| # | Title | Topics | Acceptance | Solution | Difficulty |
|---|---|---|---|---|---|
| 1 | All Occurrence Of An Element | Recursion | 59.00% | Easy | |
| 2 | Binary Tree Inorder Traversal | Recursion Trees Traversal Binary Tree | 75.68% | Easy | |
| 3 | Binary Tree Level Order Traversal | Tree Recursion Traversal Binary Tree | 79.68% | Easy | |
| 4 | Binary Tree Post Order Traversal | Tree Recursion Traversal Binary Tree | 79.59% | Easy | |
| 5 | Binary Tree Preorder Traversal | Tree Recursion Binary Tree | 79.85% | Easy | |
| 6 | Binary Tree Zigzag Level Order Traversal | Tree Recursion Traversal Binary Tree | 71.48% | Medium | |
| 7 | Categorize even and odd nodes in a Linked List | Linked List | 49.80% | Medium | |
| 8 | Check Array is Sorted | Recursion | 80.00% | Basic | |
| 9 | Check if Binary Tree is Balanced | Recursion | 77.00% | Medium | |
| 10 | Check if Linked List is Palindrome | Linked List | 67.00% | Medium | |
| 11 | Check Palindrome | Recursion | 90.00% | Easy | |
| 12 | Check String Is Subsequence To Another | Recursion | 75.00% | Medium | |
| 13 | Combination Sum | Recursion | 75.00% | Medium | |
| 14 | Combination Sum II | Recursion | 76.00% | Medium | |
| 15 | Convert String to Integer | Recursion | 60.00% | Medium | |
| 16 | Count Binary Strings | Recursion | 60.00% | Medium | |
| 17 | Count Characters | Recursion | 85.00% | Easy | |
| 18 | Count Nodes in Binary Tree | Recursion | 64.00% | Medium | |
| 19 | Count Ways To Reach Nth Stair | Recursion | 60.00% | Medium | |
| 20 | Detect Cycle In Linked List | Linked List | 65.00% | Medium | |
| 21 | Detect Loop in linked list | Linked List | 43.49% | Medium | |
| 22 | Distinct Paths | Array Recursion Dynamic Programming 2D Array | 50.00% | Medium | |
| 23 | Distinct Paths II | Array Recursion Dynamic Programming 2D Array | 50.00% | Medium | |
| 24 | Factorial of N | Recursion | 60.00% | Easy | |
| 25 | Fibonacci Series | Recursion | 85.00% | Easy | |
| 26 | Fibonacci Series (Tree Recursion) | Recursion | 60.00% | Medium | |
| 27 | Find Maximum / Minimum in Array | Recursion | 75.00% | Easy | |
| 28 | Find Middle of Linked List | Linked List | 87.00% | Easy | |
| 29 | Find Minimum In Rotated Sorted Array | Recursion | 89.00% | Medium | |
| 30 | Find Start of Cycle | Linked List | 57.00% | Medium | |
| 31 | First Occurrence Of An Element In An Array | Recursion | 75.00% | Easy | |
| 32 | Flattening a Linked List | Linked List | 51.53% | Medium | |
| 33 | Flood Fill | Recursion | 69.00% | Medium | |
| 34 | Friends Pairing Problem | Recursion | 50.00% | Medium | |
| 35 | Generate All Subsequence | Recursion | 56.00% | Medium | |
| 36 | Generate All Subsets | Recursion | 60.00% | Medium | |
| 37 | Intersection of Two Linked Lists | Linked List | 35.30% | Easy | |
| 38 | Intersection of Two Linked Lists | Linked List | 75.00% | Medium | |
| 39 | Kth from End of Linked List | Linked List | 47.30% | Medium | |
| 40 | Last Occurrence Of An Element | Recursion | 65.00% | Easy | |
| 41 | Length of Linked List | Linked List | 76.00% | Easy | |
| 42 | Letter Combinations of Phone Number | Recursion | 60.00% | Medium | |
| 43 | Merge K Sorted Lists | Linked List | 70.00% | Medium | |
| 44 | Merge Sort for Linked List | Linked List | 74.76% | Medium | |
| 45 | Merge Two Sorted Lists | Linked List | 65.70% | Medium | |
| 46 | Nth Node From End | Linked List | 69.00% | Medium | |
| 47 | Number of Islands | Recursion | 66.00% | Medium | |
| 48 | Palindrome Linked List | Linked List | 41.48% | Medium | |
| 49 | Partition Equal Subset | Recursion | 77.00% | Easy | |
| 50 | Peak Element In Rotated Array | Recursion | 88.00% | Easy |
Structured learning, live mentorship and an integrated coding platform to help you land top software engineering roles.
Loading today’s challenge…
LEAD-ACE: EdTech Platform
600+ Quick notes
900+ Hands-on labs
50+ Real-world projects
45+ Interview books
