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.
- 63problems
- 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 |
|---|---|---|---|
| 51 | Power of (a^b) Recursion | 85.00% | Easy |
| 52 | Combination Sum Recursion | 75.00% | Medium |
| 53 | Print Numbers from 1 to N Recursion | 75.00% | Easy |
| 54 | Print Number From N to 1 Recursion | 80.00% | Easy |
| 55 | Sum Of First N Natural Numbers Recursion | 60.00% | Easy |
| 56 | Word Search Recursion | 32.69% | Medium |
| 57 | Print Pattern Recursion | 56.39% | Easy |
| 58 | Subset Sums Recursion | 72.55% | Medium |
| 59 | Distinct Paths II Array · Recursion · Dynamic Programming | 50.00% | Medium |
| 60 | Distinct Paths Array · Recursion · Dynamic Programming | 50.00% | Medium |
| 61 | Tower of Hanoi Recursion | 35.23% | Medium |
| 62 | Power Of Numbers Recursion | 20.22% | Medium |
| 63 | 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.
