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.
- 88problems
- 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 | Calculate a^b Using Exponentiation by Squaring Data Structures Basics · Searching Algorithms · Sorting Algorithms | 86.53% | Basic |
| 2 | Find the Nth Fibonacci Number Efficiently Data Structures Basics · Recursion · Dynamic Programming | 85.25% | Basic |
| 3 | Flood Fill Recursion | 69.00% | Medium |
| 4 | Number of Islands Recursion | 66.00% | Medium |
| 5 | Remove Consecutive Duplicates Recursion | 60.00% | Easy |
| 6 | Binary Tree Post Order Traversal Tree · Recursion · Traversal | 79.59% | Easy |
| 7 | Binary Tree Zigzag Level Order Traversal Tree · Recursion · Traversal | 71.48% | Medium |
| 8 | Binary Tree Level Order Traversal Tree · Recursion · Traversal | 79.68% | Easy |
| 9 | Binary Tree Inorder Traversal Recursion · Trees · Traversal | 75.68% | Easy |
| 10 | Binary Tree Preorder Traversal Tree · Recursion · Binary Tree | 79.85% | Easy |
| 11 | Intersection of Two Linked Lists Linked List | 75.00% | Medium |
| 12 | Sort A Linked List (Merge Sort) Linked List | 58.00% | Medium |
| 13 | Merge K Sorted Lists Linked List | 70.00% | Medium |
| 14 | Swap Nodes in Pairs Linked List | 65.00% | Medium |
| 15 | Reverse Sublist (Between Left & Right) Linked List | 67.00% | Medium |
| 16 | Reverse Linked List in K Groups Linked List | 60.00% | Medium |
| 17 | Reverse Linked List in Pairs Linked List | 63.00% | Medium |
| 18 | Remove Nth Node From End Linked List | 73.00% | Medium |
| 19 | Check if Linked List is Palindrome Linked List | 67.00% | Medium |
| 20 | Detect Cycle In Linked List Linked List | 65.00% | Medium |
| 21 | Find Start of Cycle Linked List | 57.00% | Medium |
| 22 | Reverse A Linked List Linked List | 79.00% | Easy |
| 23 | Length of Linked List Linked List | 76.00% | Easy |
| 24 | Nth Node From End Linked List | 69.00% | Medium |
| 25 | Find Middle of Linked List Linked List | 87.00% | Easy |
| 26 | Search in a 2D Matrix Recursion · Binary Search | 86.00% | Medium |
| 27 | Find Minimum In Rotated Sorted Array Recursion | 89.00% | Medium |
| 28 | Peak Element In Rotated Array Recursion | 88.00% | Easy |
| 29 | Generate All Subsequence Recursion | 56.00% | Medium |
| 30 | Check if Binary Tree is Balanced Recursion | 77.00% | Medium |
| 31 | Generate All Subsets Recursion | 60.00% | Medium |
| 32 | Count Nodes in Binary Tree Recursion | 64.00% | Medium |
| 33 | Letter Combinations of Phone Number Recursion | 60.00% | Medium |
| 34 | Tiling Problem Recursion | 50.00% | Medium |
| 35 | Permutation Without Duplicates Recursion | 67.00% | Medium |
| 36 | Combination Sum II Recursion | 76.00% | Medium |
| 37 | Target Sum Ways Recursion | 64.00% | Hard |
| 38 | Partition Equal Subset Recursion | 77.00% | Easy |
| 39 | Unique Path Recursion | 56.00% | Hard |
| 40 | Rat In A Maze Recursion | 38.00% | Hard |
| 41 | Permutation of an Array Array · Recursion | 68.00% | Medium |
| 42 | Permutation of A String String · Recursion | 66.00% | Medium |
| 43 | Subsets with Duplicates Recursion | 74.00% | Medium |
| 44 | Factorial of N Recursion | 60.00% | Easy |
| 45 | Count Ways To Reach Nth Stair Recursion | 60.00% | Medium |
| 46 | Friends Pairing Problem Recursion | 50.00% | Medium |
| 47 | Count Binary Strings Recursion | 60.00% | Medium |
| 48 | Fibonacci Series (Tree Recursion) Recursion | 60.00% | Medium |
| 49 | Check String Is Subsequence To Another Recursion | 75.00% | Medium |
| 50 | Convert String to Integer Recursion | 60.00% | 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.
Asked at companies like
