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.
- 30problems
- 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 | Flood Fill Recursion | 69.00% | Medium |
| 2 | Number of Islands Recursion | 66.00% | Medium |
| 3 | Binary Tree Zigzag Level Order Traversal Tree · Recursion · Traversal | 71.48% | Medium |
| 4 | Search in a 2D Matrix Recursion · Binary Search | 86.00% | Medium |
| 5 | Find Minimum In Rotated Sorted Array Recursion | 89.00% | Medium |
| 6 | Generate All Subsequence Recursion | 56.00% | Medium |
| 7 | Check if Binary Tree is Balanced Recursion | 77.00% | Medium |
| 8 | Generate All Subsets Recursion | 60.00% | Medium |
| 9 | Count Nodes in Binary Tree Recursion | 64.00% | Medium |
| 10 | Letter Combinations of Phone Number Recursion | 60.00% | Medium |
| 11 | Tiling Problem Recursion | 50.00% | Medium |
| 12 | Permutation Without Duplicates Recursion | 67.00% | Medium |
| 13 | Combination Sum II Recursion | 76.00% | Medium |
| 14 | Permutation of an Array Array · Recursion | 68.00% | Medium |
| 15 | Permutation of A String String · Recursion | 66.00% | Medium |
| 16 | Subsets with Duplicates Recursion | 74.00% | Medium |
| 17 | Count Ways To Reach Nth Stair Recursion | 60.00% | Medium |
| 18 | Friends Pairing Problem Recursion | 50.00% | Medium |
| 19 | Count Binary Strings Recursion | 60.00% | Medium |
| 20 | Fibonacci Series (Tree Recursion) Recursion | 60.00% | Medium |
| 21 | Check String Is Subsequence To Another Recursion | 75.00% | Medium |
| 22 | Convert String to Integer Recursion | 60.00% | Medium |
| 23 | Combination Sum Recursion | 75.00% | Medium |
| 24 | Word Search Recursion | 32.69% | Medium |
| 25 | Subset Sums Recursion | 72.55% | Medium |
| 26 | Distinct Paths II Array · Recursion · Dynamic Programming | 50.00% | Medium |
| 27 | Distinct Paths Array · Recursion · Dynamic Programming | 50.00% | Medium |
| 28 | Tower of Hanoi Recursion | 35.23% | Medium |
| 29 | Power Of Numbers Recursion | 20.22% | Medium |
| 30 | Sort a stack Recursion | 69.19% | 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.
