Think in patterns.
Solve like it’s the interview.
hand-picked DSA problems in C#, Java, Python, C++ and JavaScript. Run your code, climb the leaderboard and keep your streak alive.
- 142problems
- 12core patterns
- 5languages
- 2 Lakh+learners trained
Bubble sort
ArraysO(n²)Running
Compare neighbours, swap when out of order.
Inorder traversal
TreesDFSO(n)
Visit order:
Breadth-first search
GraphsQueueO(V+E)
Level order:
Longest common subsequence
Dynamic ProgrammingO(mn)
dp[i][j] = best length for the first i and j characters.
Browse by pattern
Master the idea once, solve the whole family.
| # | Title | Acceptance | Difficulty |
|---|---|---|---|
| 101 | Categorize even and odd nodes in a Linked List Linked List | 49.80% | Medium |
| 102 | Asteroid Collision Stack | 50.06% | Medium |
| 103 | Convert Infix To Prefix Notation Stack | 52.94% | Medium |
| 104 | Minimum Cost of Ropes Queue | 42.73% | Medium |
| 105 | Heap Sort Heap | 53.06% | Medium |
| 106 | Word Search Recursion | 32.69% | Medium |
| 107 | Minimum sum Array · Sorting Algorithms | 17.14% | Medium |
| 108 | Number of Pairs Array | 21.82% | Medium |
| 109 | Super Primes Searching Algorithms | 24.90% | Medium |
| 110 | 0-1 Knapsack Problem Array · Dynamic Programming | 50.00% | Medium |
| 111 | Rod Cutting Array · Dynamic Programming | 50.00% | Medium |
| 112 | Stock buy and sell Array · Dynamic Programming | 29.18% | Medium |
| 113 | Maximum Meetings in One Room Array · Sorting Algorithms | 33.57% | Medium |
| 114 | Subset Sums Recursion | 72.55% | Medium |
| 115 | Interleave the First Half of the Queue with Second Half Queue | 69.35% | Medium |
| 116 | Merge Sort for Linked List Linked List | 74.76% | Medium |
| 117 | Reverse a Linked List in Groups Linked List | 57.08% | Medium |
| 118 | First Occurrence In A String String | 50.08% | Medium |
| 119 | Distinct Paths II Array · Recursion · Dynamic Programming | 50.00% | Medium |
| 120 | Minimum Path Sum Array · Dynamic Programming · 2D Array | 50.00% | Medium |
| 121 | Distinct Paths Array · Recursion · Dynamic Programming | 50.00% | Medium |
| 122 | Longest Increasing Subsequence Array · Dynamic Programming | 20.00% | Medium |
| 123 | Longest Common Subsequence Array · String · Dynamic Programming | 50.00% | Medium |
| 124 | Find Largest Value in Each Tree Row Tree | 50.00% | Medium |
| 125 | 3 Sum Array · Sorting Algorithm | 35.80% | Medium |
| 126 | K-Pangrams String · Hashing | 20.91% | Medium |
| 127 | Stepping Numbers BFS · DFS | 48.44% | Medium |
| 128 | Course Schedule Graph · BFS · DFS | 51.77% | Medium |
| 129 | Maximize dot product Dynamic Programming | 13.27% | Medium |
| 130 | Smallest factorial number Searching Algorithms | 38.79% | Medium |
| 131 | Quick Sort Sorting Algorithms | 55.23% | Medium |
| 132 | Tower of Hanoi Recursion | 35.23% | Medium |
| 133 | Power Of Numbers Recursion | 20.22% | Medium |
| 134 | Sort a stack Recursion | 69.19% | Medium |
| 135 | Reverse First K elements of Queue Queue | 81.28% | Medium |
| 136 | Number of NGEs to the right Stack | 56.74% | Medium |
| 137 | Flattening a Linked List Linked List | 51.53% | Medium |
| 138 | Kth from End of Linked List Linked List | 47.30% | Medium |
| 139 | Merge Two Sorted Lists Linked List | 65.70% | Medium |
| 140 | Maximum Subarray Sum Array | 36.28% | Medium |
| 141 | Strings Rotations String | 43.83% | Medium |
| 142 | Unique Permutations String | 46.50% | Medium |
Practice that builds the habit
Three steps, repeated every day.
- 1
Pick a pattern
Start from an idea such as two pointers or BFS, then move through easy, medium and hard.
- 2
Code and run
Write in your language, run on sample cases and submit against every hidden test.
- 3
Climb the board
Every solve earns points. Keep a daily streak and see where you stand this month.
Want a plan, not just problems?
The DSA bootcamp adds structured lessons, live mentorship and mock interviews on top of this practice platform.
