Here you will get All Solutions for Topics from LeetCode Platform which i Solve on Regular Basic
- LeetCode 75 Study Plan to Ace Interview Level 1
- LeetCode 75 Study Plan to Ace Interview Level 2
- All Practice Problems
| Problem Name | Difficulty Level | Solution | Time Complexity | Space Complexity | |
|---|---|---|---|---|---|
| 1 | Two Sum | Easy | Click Here | O(n) | O(n) |
| 9 | Palindrome Number | Easy | Click Here | O(log n) | O(log n) |
| 13 | Roman to Integer | Easy | Click Here | O(n) | O(1) |
| 16 | 3Sum Closest | Medium | Click Here | O(n^n) | O(ans) |
| 21 | Merge Two Sorted Lists | Easy | Click Here | O(n1+n2) | O(n1+n2) |
| 62 | Unique Paths | Medium | Click Here | O(m*n) | O(n) |
| 70 | Climbing Stairs | Easy | Click Here | O(n) | O(1) |
| 98 | Validate Binary Search Tree | Medum | Click Here | O(n) | O(h) |
| 102 | Binary Tree Level Order Traversal | Medium | Click Here | O(n) | O(n) |
| 110 | Balanced Binary Tree | Easy | Click Here | O(n log n) | O(h) |
| 121 | Best Time to Buy and Sell Stock | Easy | Click Here | O(n) | O(1) |
| 142 | Linked List Cycle 2 | Medium | Click Here | O(n) | O(1) |
| 173 | Balanced Search Tree Iterator | Medium | Click Here | O(h) | O(h) |
| 199 | Binary Tree Right Side View | Medium | Click Here | O(n) | O(n) |
| 200 | Number of Islands | Medium | Click Here | O(m*n) | O(min(m,n)) |
| 205 | Isomorphic Strings | Easy | Click Here | O(n) | O(1) |
| 206 | Reverse Linked List | Easy | Click Here | O(n) | O(1) |
| 227 | Basic Calculator 2 | Medium | Click Here | O(n) | O(1) |
| 278 | First Bad Version | Easy | Click Here | O(log n) | O(1) |
| 235 | Lowest Common Ancestor of a Binary Search Tree | Easy | Click Here | O(h) | O(h) |
| 299 | Bulls and Cows | Medium | Click Here | O(n) | O(1) |
| 322 | Coin Change | Medium | Click Here | O(m*n) | O(m) |
| 392 | Is Subsequence | Easy | Click Here | O(n) | O(1) |
| 394 | Decode String | Medium | Click Here | O(n) | O(n) |
| 409 | Longest Palindrome | Easy | Click Here | O(n) | O(1) |
| 424 | Longest Repeating Character Replacement | Medium | Click Here | O(n) | O(1) |
| 438 | Find All Anagrams in a String | Medium | Click Here | O(n) | O(1) |
| 509 | Fibonacci Number | Easy | Click Here | O(n) | O(1) |
| 589 | N-ary-Tree-Preorder-Traversal | Easy | Click Here | O(n) | O(n) |
| 629 | Top K Frequent Words | Medium | Click Here | O(n) | O(n) |
| 704 | Binary Search | Easy | Click Here | O(log n) | O(1) |
| 724 | Find Pivot Index | Easy | Click Here | O(n) | O(1) |
| 733 | Flood Fill | Easy | Click Here | O(n^2) | O(n^2) |
| 735 | Asteroid Collision | Medium | Click Here | O(n) | O(n) |
| 746 | Min Cost Climbing Stairs | Easy | Click Here | O(n) | O(1) |
| 815 | Bus Routes | Hard | Click Here | O(n^2) | O(n^2) |
| 844 | Backspace String Compare | Easy | Click Here | O(n) | O(1) |
| 876 | Middle of the Linked List | Easy | Click Here | O(n) | O(1) |
| 1046 | Last Stone Weight | Easy | Click Here | O(n log n) | O(n) |
| 1480 | Running Sum of 1d Array | Easy | Click Here | O(n) | O(1) |
If you have any feedback, please reach out to us at harsh.thakkar0369@gmail.com
