| # | Title | Topics | Acceptance | Solution | Difficulty |
|---|---|---|---|---|---|
| 1 | Check Whether Three Numbers Form a Geometric Progression | Data Structures Basics Comparisons | 82.80% | Basic | |
| 2 | Check Whether Three Angles Form a Valid Triangle | Data Structures Basics Comparisons | 80.89% | Basic | |
| 3 | Classify a Triangle Using Sides and Angles | Data Structures Basics Comparisons | 73.99% | Basic | |
| 4 | Create a Menu-Driven Scientific Calculator | Data Structures Basics | 100.00% | Basic | |
| 5 | Calculate Movie Ticket Price Based on Age, Day and Seat Type | Data Structures Basics | 96.93% | Basic | |
| 6 | Find the Second Smallest of Four Numbers | Sorting Algorithms Comparisons | 89.17% | Basic | |
| 7 | Find the Second Largest of Four Numbers | Sorting Algorithms Comparisons | 79.82% | Basic | |
| 8 | Find the Middle Value Among Three Distinct Numbers | Comparisons | 82.79% | Basic | |
| 9 | Sort Three Numbers Using Conditional Statements | Data Structures Basics Sorting Algorithms Sorting Algorithm Comparisons sorts & algorithms | 93.23% | Basic | |
| 10 | Check Whether Three Numbers Form an Arithmetic Progression | Data Structures Basics | 73.03% | Basic | |
| 11 | Check Whether Three Angles Form a Valid Triangle | Comparisons | 91.52% | ||
| 12 | Sort Three Numbers Using Conditional Statements | Comparisons | 90.15% | ||
| 13 | Find the Middle Value Among Three Distinct Numbers | Comparisons | 84.12% | ||
| 14 | Count of Subsets with Given Sum | Dynamic Programming | 45.45% | ||
| 15 | Find the Second Smallest of Four Numbers | Array Sorting Algorithms | 89.85% | ||
| 16 | Find the Second Largest of Four Numbers | Array Sorting Algorithms | 89.48% | ||
| 17 | Game with String | Heap | 53.96% | Medium | |
| 18 | Kth largest element | Heap | 64.92% | Medium | |
| 19 | Min Number of Jumps | Dynamic Programming | 50.48% | Medium | |
| 20 | House Robber | Dynamic Programming | 51.45% | Medium | |
| 21 | Min Cost Climbing Stairs | Dynamic Programming | 65.21% | Easy | |
| 22 | Odd Even Graph Check | Graph | 63.45% | Medium | |
| 23 | Redundant Connection | Graph | 68.71% | Medium | |
| 24 | Detect Cycle in Undirected Graph (DFS) | Graph | 67.77% | Medium | |
| 25 | Path Existence Between Two Nodes | Graph | 80.12% | Easy | |
| 26 | Detect Cycle in Directed Graph (DFS) | Graph | 67.67% | Medium | |
| 27 | Level of Each Node | Graph | 74.21% | Medium | |
| 28 | BFS Traversal | Graph | 83.12% | Easy | |
| 29 | DFS Traversal | Graph DFS Traversal | 85.64% | Easy | |
| 30 | Flood Fill | Recursion | 69.00% | Medium | |
| 31 | Number of Islands | Recursion | 66.00% | Medium | |
| 32 | Remove Duplicates From A String | String Stack | 61.68% | Easy | |
| 33 | Remove Consecutive Duplicates | Recursion | 60.00% | Easy | |
| 34 | Find Element in a Sorted Array | Binary Search | 80.00% | Easy | |
| 35 | Binary Tree Cameras | Tree Traversal Binary Tree | 55.21% | Hard | |
| 36 | Boundary Traversal | Tree Traversal Binary Tree | 45.21% | Hard | |
| 37 | Compare Leaf Traversal | Tree Traversal Binary Tree | 77.95% | Medium | |
| 38 | Binary Tree Post Order Traversal | Tree Recursion Traversal Binary Tree | 79.59% | Easy | |
| 39 | Inorder Successor in BST | Tree Traversal Binary Tree | 60.12% | Medium | |
| 40 | Kth Largest Element in BST | Tree Traversal Binary Tree | 70.53% | Medium | |
| 41 | Construct Tree from Inorder + Postorder | Tree Traversal Binary Tree | 65.12% | Medium | |
| 42 | Top View of Binary Tree | Tree Traversal Binary Tree | 60.21% | Medium | |
| 43 | Convert Sorted Array to BST | Tree Traversal Binary Tree | 74.56% | Medium | |
| 44 | Find Maximum in BST | Tree Traversal Binary Tree | 85.54% | Easy | |
| 45 | Find Minimum in BST | Tree Traversal Binary Tree | 85.18% | Easy | |
| 46 | Find Distance Between Two Nodes | Tree Traversal Binary Tree | 62.45% | Medium | |
| 47 | All Paths With Given Sum | Tree Traversal Binary Tree | 74.23% | Medium | |
| 48 | Maximum Root to Leaf Path Sum | Tree Traversal Binary Tree | 72.15% | Medium | |
| 49 | Count Non-Leaf Nodes In Binary Tree | Tree Traversal Binary Tree | 60.48% | Easy | |
| 50 | Minimum Depth of Binary Tree | Tree Traversal Binary Tree | 60.25% | Medium |
Loading today’s challenge…