Live Batches
Masterclasses
Menu
Free Courses
Account
Login / Sign Up

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.

Start practicing
  • 297problems
  • 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
151Minimum Speed to Arrive on Time Binary Search69.00%Medium
152Koko Eating Bananas Binary Search68.00%Medium
153Peak Element In Rotated Array Recursion88.00%Easy
154Find Rotation Count Binary Search75.00%Easy
155Search in Rotated Array II Binary Search79.00%Easy
156Upper Bound Binary Search80.00%Easy
157Check if Element Exists Binary Search87.00%Easy
158Binary Search (Iterative) Binary Search79.00%Easy
159Generate All Subsequence Recursion56.00%Medium
160Check if Binary Tree is Balanced Recursion77.00%Medium
161Generate All Subsets Recursion60.00%Medium
162Count Nodes in Binary Tree Recursion64.00%Medium
163Letter Combinations of Phone Number Recursion60.00%Medium
164Tiling Problem Recursion50.00%Medium
165Permutation Without Duplicates Recursion67.00%Medium
166Combination Sum II Recursion76.00%Medium
167Target Sum Ways Recursion64.00%Hard
168Partition Equal Subset Recursion77.00%Easy
169Unique Path Recursion56.00%Hard
170Rat In A Maze Recursion38.00%Hard
171Permutation of an Array Array · Recursion68.00%Medium
172Permutation of A String String · Recursion66.00%Medium
173Subsets with Duplicates Recursion74.00%Medium
174Factorial of N Recursion60.00%Easy
175Count Ways To Reach Nth Stair Recursion60.00%Medium
176Friends Pairing Problem Recursion50.00%Medium
177Count Binary Strings Recursion60.00%Medium
178Fibonacci Series (Tree Recursion) Recursion60.00%Medium
179Check String Is Subsequence To Another Recursion75.00%Medium
180Convert String to Integer Recursion60.00%Medium
181Replace pi to 3.14 Recursion75.00%Easy
182Remove All Occurrence of A Character Recursion75.00%Easy
183Count Characters Recursion85.00%Easy
184Check Palindrome Recursion90.00%Easy
185Reverse A String Recursion48.00%Easy
186Product of All Array Elements Recursion80.00%Easy
187Sum of Array Elements Recursion58.00%Easy
188Reverse An Array Recursion85.00%Easy
189All Occurrence Of An Element Recursion59.00%Easy
190Last Occurrence Of An Element Recursion65.00%Easy
191First Occurrence Of An Element In An Array Recursion75.00%Easy
192Check Array is Sorted Recursion80.00%Basic
193Smallest window of 0, 1 and 2 String50.00%Easy
194Find Maximum / Minimum in Array Recursion75.00%Easy
195Print Array Elements Recursion50.00%Easy
196Fibonacci Series Recursion85.00%Easy
197Power of (a^b) Recursion85.00%Easy
198Roman Number to Integer String43.21%Easy
199Longest Palindromic Substring String34.80%Medium
200Missing And Repeating Array24.83%Easy

Practice that builds the habit

Three steps, repeated every day.

  1. 1

    Pick a pattern

    Start from an idea such as two pointers or BFS, then move through easy, medium and hard.

  2. 2

    Code and run

    Write in your language, run on sample cases and submit against every hidden test.

  3. 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
  • Microsoft
  • Google
  • Amazon
  • Adobe
  • Oracle
  • Samsung
  • Cisco
  • IBM