Live Batches
Masterclasses
Menu
Free Courses
Account
Login / Sign Up
DSA Problems
Practice real interview questions and track your progress
244 problems
# Title Topics Acceptance SolutionDifficulty
1Check Whether Three Angles Form a Valid TriangleComparisons
91.52%
2Sort Three Numbers Using Conditional StatementsComparisons
90.15%
3Find the Middle Value Among Three Distinct NumbersComparisons
84.12%
4Count of Subsets with Given SumDynamic Programming
45.45%
5Find the Second Smallest of Four NumbersArray Sorting Algorithms
89.85%
6Find the Second Largest of Four NumbersArray Sorting Algorithms
89.48%
7Game with StringHeap
53.96%
Medium
8Kth largest elementHeap
64.92%
Medium
9Min Number of JumpsDynamic Programming
50.48%
Medium
10House RobberDynamic Programming
51.45%
Medium
11Min Cost Climbing StairsDynamic Programming
65.21%
Easy
12Odd Even Graph CheckGraph
63.45%
Medium
13Redundant ConnectionGraph
68.71%
Medium
14Detect Cycle in Undirected Graph (DFS)Graph
67.77%
Medium
15Path Existence Between Two NodesGraph
80.12%
Easy
16Detect Cycle in Directed Graph (DFS)Graph
67.67%
Medium
17Level of Each NodeGraph
74.21%
Medium
18BFS TraversalGraph
83.12%
Easy
19DFS TraversalGraph DFS Traversal
85.64%
Easy
20Flood FillRecursion
69.00%
Medium
21Number of IslandsRecursion
66.00%
Medium
22Remove Duplicates From A StringString Stack
61.68%
Easy
23Remove Consecutive DuplicatesRecursion
60.00%
Easy
24Find Element in a Sorted ArrayBinary Search
80.00%
Easy
25Binary Tree CamerasTree Traversal Binary Tree
55.21%
Hard
26Boundary TraversalTree Traversal Binary Tree
45.21%
Hard
27Compare Leaf TraversalTree Traversal Binary Tree
77.95%
Medium
28Binary Tree Post Order TraversalTree Recursion Traversal Binary Tree
79.59%
Easy
29Inorder Successor in BSTTree Traversal Binary Tree
60.12%
Medium
30Kth Largest Element in BSTTree Traversal Binary Tree
70.53%
Medium
31Construct Tree from Inorder + PostorderTree Traversal Binary Tree
65.12%
Medium
32Top View of Binary TreeTree Traversal Binary Tree
60.21%
Medium
33Convert Sorted Array to BSTTree Traversal Binary Tree
74.56%
Medium
34Find Maximum in BSTTree Traversal Binary Tree
85.54%
Easy
35Find Minimum in BSTTree Traversal Binary Tree
85.18%
Easy
36Find Distance Between Two NodesTree Traversal Binary Tree
62.45%
Medium
37All Paths With Given SumTree Traversal Binary Tree
74.23%
Medium
38Maximum Root to Leaf Path SumTree Traversal Binary Tree
72.15%
Medium
39Count Non-Leaf Nodes In Binary TreeTree Traversal Binary Tree
60.48%
Easy
40Minimum Depth of Binary Tree Tree Traversal Binary Tree
60.25%
Medium
41Construct Tree from Inorder + PreorderTree Traversal Binary Tree
70.00%
Medium
42Right View of Binary TreeTree Traversal Binary Tree
74.36%
Medium
43Lowest Common Ancestor in BSTTree Traversal Binary Tree
70.50%
Medium
44Kth Smallest Element in BSTTree Traversal Binary Tree
76.77%
Medium
45Maximum Path Sum in Binary TreeTree Traversal Binary Tree
58.59%
Hard
46Delete Node In BSTTree Traversal Binary Tree
65.20%
Medium
47Validate BSTTree Traversal Binary Tree
45.23%
Medium
48Search / Insert into BSTTree Traversal Binary Tree
89.54%
Easy
49Find Nodes at Distance K from Given NodeTree Traversal Binary Tree
65.95%
Hard
50Lowest Common Ancestor of Binary TreeTree Traversal Binary Tree
78.59%
Medium
🚀 DSA BOOTCAMP
Crack Product Company Interviews

Structured learning, live mentorship and an integrated coding platform to help you land top software engineering roles.

ScholarHat DSA Bootcamp
₹32 LPAAvg Package
50K+Jobs
300+Problems Covered
20+Patterns
Explore Bootcamp →
Problem Of The Day 🔥

Loading today’s challenge…

Leaderboard
  • 1 🏆 Ashok 1370.00
  • 2 🥈 Umar 830.00
  • 3 🥉 Priyanka 779.00
  • 4 Poorani 480.00
  • 5 Khwaja 460.00
  • 6 Narmitha 450.00
  • 7 Sayyad 450.00
  • 8 I Gusti Ngurah Nugraha 440.00
  • 9 Aparna 420.00
  • 10 Kavipriya 390.00
View More
Curated Problems, Asked at companies like
Microsoft Google Amazon Adobe Oracle Microsoft Google Amazon Adobe Oracle
Samsung Cisco IBM Paytm Infosys Samsung Cisco IBM Paytm Infosys
Solve today's challenge

Keep your streak alive and climb the leaderboard.

Start now →