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.
- 10problems
- 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 | Binary Tree Cameras Tree · Traversal · Binary Tree | 55.21% | Hard |
| 2 | Boundary Traversal Tree · Traversal · Binary Tree | 45.21% | Hard |
| 3 | Maximum Path Sum in Binary Tree Tree · Traversal · Binary Tree | 58.59% | Hard |
| 4 | Find Nodes at Distance K from Given Node Tree · Traversal · Binary Tree | 65.95% | Hard |
| 5 | Print All Root To Leaf Paths Tree · Traversal · Binary Tree | 68.59% | Hard |
| 6 | Smallest Window of All Characters String · Dynamic Programming | 50.00% | Hard |
| 7 | Alien Dictionary String | 47.81% | Hard |
| 8 | Find the String String | 72.98% | Hard |
| 9 | Making A Large Island Graph · BFS · DFS | 52.36% | Hard |
| 10 | Redundant Parenthesis String · Stack | 51.49% | Hard |
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.
