DSA
Master the patterns
Search the bank, then filter by difficulty, pattern, data structure, or algorithm. Each problem includes approaches, solutions, and walkthroughs.
Active·2,723
Easy·667
Medium·1,394
Hard·662
Patterns
Recognize the move
Filter the bank by pattern — each card links into the problem index.
Problem index
Browse problems
Search by title, then refine with facets. Sorted by problem ID.
Difficulty
Facets
20 of 26 matching · 2723 totalSort: id ↑
No.ProblemDifficulty
- 0386Evaluate DivisionMed
- 0697Network Delay TimeMed
- 0741Cheapest Flights Within K StopsMed
- 0836Reachable Nodes In Subdivided GraphHard
- 1240Find the City With the Smallest Number of Neighbors at a Threshold DistanceMed
- 1269Minimum Cost to Make at Least One Valid Path in a GridHard
- 1396Path with Maximum ProbabilityMed
- 1634Number of Restricted Paths From First to Last NodeMed
- 1801Number of Ways to Arrive at DestinationMed
- 1862Second Minimum Time to Reach DestinationHard
- 2007Minimum Weighted Subgraph With the Required PathsHard
- 2088Minimum Obstacle Removal to Reach CornerHard
- 2357Minimum Time to Visit a Cell In a GridHard
- 2402Design Graph With Shortest Path CalculatorHard
- 2419Minimum Cost of a Path With Special RoadsMed
- 2439Modify Graph Edge WeightsHard
- 2639Number of Possible Sets of Closing BranchesHard
- 2656Minimum Cost to Convert String IMed
- 2657Minimum Cost to Convert String IIHard
- 2765Minimum Time to Visit Disappearing NodesMed
Showing 20 of 26