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.
- 32problems
- 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 | Remove Consecutive Duplicates Recursion | 60.00% | Easy |
| 2 | Binary Tree Post Order Traversal Tree · Recursion · Traversal | 79.59% | Easy |
| 3 | Binary Tree Level Order Traversal Tree · Recursion · Traversal | 79.68% | Easy |
| 4 | Binary Tree Inorder Traversal Recursion · Trees · Traversal | 75.68% | Easy |
| 5 | Binary Tree Preorder Traversal Tree · Recursion · Binary Tree | 79.85% | Easy |
| 6 | Reverse A Linked List Linked List | 79.00% | Easy |
| 7 | Length of Linked List Linked List | 76.00% | Easy |
| 8 | Find Middle of Linked List Linked List | 87.00% | Easy |
| 9 | Peak Element In Rotated Array Recursion | 88.00% | Easy |
| 10 | Partition Equal Subset Recursion | 77.00% | Easy |
| 11 | Factorial of N Recursion | 60.00% | Easy |
| 12 | Replace pi to 3.14 Recursion | 75.00% | Easy |
| 13 | Remove All Occurrence of A Character Recursion | 75.00% | Easy |
| 14 | Count Characters Recursion | 85.00% | Easy |
| 15 | Check Palindrome Recursion | 90.00% | Easy |
| 16 | Reverse A String Recursion | 48.00% | Easy |
| 17 | Product of All Array Elements Recursion | 80.00% | Easy |
| 18 | Sum of Array Elements Recursion | 58.00% | Easy |
| 19 | Reverse An Array Recursion | 85.00% | Easy |
| 20 | All Occurrence Of An Element Recursion | 59.00% | Easy |
| 21 | Last Occurrence Of An Element Recursion | 65.00% | Easy |
| 22 | First Occurrence Of An Element In An Array Recursion | 75.00% | Easy |
| 23 | Find Maximum / Minimum in Array Recursion | 75.00% | Easy |
| 24 | Print Array Elements Recursion | 50.00% | Easy |
| 25 | Fibonacci Series Recursion | 85.00% | Easy |
| 26 | Power of (a^b) Recursion | 85.00% | Easy |
| 27 | Print Numbers from 1 to N Recursion | 75.00% | Easy |
| 28 | Print Number From N to 1 Recursion | 80.00% | Easy |
| 29 | Sum Of First N Natural Numbers Recursion | 60.00% | Easy |
| 30 | Print Pattern Recursion | 56.39% | Easy |
| 31 | Intersection of Two Linked Lists Linked List | 35.30% | Easy |
| 32 | Reverse a Linked List Linked List | 78.10% | Easy |
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.
