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.
- 19problems
- 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 |
|---|---|---|---|
| 1 | Permutation of an Array Array · Recursion | 68.00% | Medium |
| 2 | Search In Rotated Sorted Array Array · Searching Algorithms | 37.64% | Medium |
| 3 | Count Inversions Array · Sorting Algorithms | 16.93% | Medium |
| 4 | Maximize Number of 1's Array · Binary Search | 50.00% | Medium |
| 5 | Minimum sum Array · Sorting Algorithms | 17.14% | Medium |
| 6 | Number of Pairs Array | 21.82% | Medium |
| 7 | 0-1 Knapsack Problem Array · Dynamic Programming | 50.00% | Medium |
| 8 | Rod Cutting Array · Dynamic Programming | 50.00% | Medium |
| 9 | Stock buy and sell Array · Dynamic Programming | 29.18% | Medium |
| 10 | Maximum Meetings in One Room Array · Sorting Algorithms | 33.57% | Medium |
| 11 | Distinct Paths II Array · Recursion · Dynamic Programming | 50.00% | Medium |
| 12 | Minimum Path Sum Array · Dynamic Programming · 2D Array | 50.00% | Medium |
| 13 | Distinct Paths Array · Recursion · Dynamic Programming | 50.00% | Medium |
| 14 | Longest Increasing Subsequence Array · Dynamic Programming | 20.00% | Medium |
| 15 | Longest Common Subsequence Array · String · Dynamic Programming | 50.00% | Medium |
| 16 | 3 Sum Array · Sorting Algorithm | 35.80% | Medium |
| 17 | Stepping Numbers BFS · DFS | 48.44% | Medium |
| 18 | Course Schedule Graph · BFS · DFS | 51.77% | Medium |
| 19 | Maximum Subarray Sum Array | 36.28% | 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.
