| 01 |
Two Sum |
⭐⭐⭐⭐ |
https://leetcode.com/problems/two-sum/solutions/737092/sum-megapost-python3-solution-with-a-detailed-explanation/ |
The detailed solution is a mega post for all similar sum kind problem in leetcode. |
| 02 |
Valid Parentheses |
|
|
|
| 03 |
Merge Two Sorted Lists |
|
|
|
| 04 |
Best Time to Buy and Sell Stock |
⭐⭐⭐⭐ |
https://leetcode.com/problems/best-time-to-buy-and-sell-stock/solutions/900050/fully-explained-all-buy-and-sell-problems-c-recursive-memoization-minor-difference/ |
This can also be solved by prefix array and max subarray sum. |
| 05 |
Valid Palindrome |
|
|
|
| 06 |
Invert Binary Tree |
|
|
|
| 07 |
Valid Anagram |
|
|
|
| 08 |
Binary Search |
⭐⭐⭐⭐ |
https://leetcode.com/discuss/general-discussion/786126/Python-Powerful-Ultimate-Binary-Search-Template.-Solved-many-problems |
The Post provides a detailed template for Binary Search. |
| 09 |
Flood Fill |
|
|
|
| 10 |
Lowest Common Ancestor of a Binary Search Tree |
|
|
|
| 11 |
Balanced Binary Tree |
|
|
|
| 12 |
Linked List Cycle |
⭐⭐⭐⭐ |
https://leetcode.com/problems/add-two-numbers/solutions/1340/a-summary-about-how-to-solve-linked-list-problem-c/ |
This is a detailed post for linked list problems summary. |
| 13 |
Implement Queue using Stacks |
|
|
|
| 14 |
First Bad Version |
|
|
|
| 15 |
Ransom Note |
|
|
|
| 16 |
Climbing Stairs |
|
|
|
| 17 |
Longest Palindrome |
|
|
|
| 18 |
Reverse Linked List |
⭐⭐ |
|
Reversing a Linked List may seem to be a simple problem but it uses 3 pointers. The challenge is to reverse a Linked List using 2 pointers. This involves the idea of XOR. |
| 19 |
Majority Element |
⭐ |
https://leetcode.com/problems/majority-element/solutions/3676530/3-method-s-beats-100-c-java-python-beginner-friendly/ |
|
| 20 |
Add Binary |
|
|
|
| 21 |
Diameter of Binary Tree |
|
|
|
| 22 |
Middle of the Linked List |
|
|
|
| 23 |
Maximum Depth of Binary Tree |
|
|
|
| 24 |
Contains Duplicate |
|
|
|
| 25 |
Maximum Subarray |
⭐⭐⭐⭐ |
https://leetcode.com/problems/maximum-subarray/solutions/1595195/c-python-7-simple-solutions-w-explanation-brute-force-dp-kadane-divide-conquer/ |
|
| 26 |
Insert Interval |
|
|
|
| 27 |
01 Matrix |
|
|
|
| 28 |
K Closest Points to Origin |
|
|
|
| 29 |
Longest Substring Without Repeating Characters |
|
|
|
| 30 |
3Sum |
|
|
|
| 31 |
Binary Tree Level Order Traversal |
|
|
|
| 32 |
Clone Graph |
|
|
|
| 33 |
Evaluate Reverse Polish Notation |
|
|
|
| 34 |
Course Schedule |
|
|
|
| 35 |
Implement Trie (Prefix Tree) |
|
|
|
| 36 |
Coin Change |
|
|
|
| 37 |
Product of Array Except Self |
|
|
|
| 38 |
Min Stack |
|
|
|
| 39 |
Validate Binary Search Tree |
|
|
|
| 40 |
Number of Islands |
|
|
|
| 41 |
Rotting Oranges |
|
|
|
| 42 |
Search in Rotated Sorted Array |
|
|
|
| 43 |
Combination Sum |
⭐⭐⭐⭐ |
https://leetcode.com/problems/combination-sum/solutions/429538/General-Backtracking-questions-solutions-in-Python-for-reference-:/ |
The detailed solution is a mega post for all similar backtracking kind problem in leetcode. |
| 44 |
Permutations |
|
|
|
| 45 |
Merge Intervals |
|
|
|
| 46 |
Lowest Common Ancestor of a Binary Tree |
|
|
|
| 47 |
Time Based Key-Value Store |
|
|
|
| 48 |
Accounts Merge |
|
|
|
| 49 |
Sort Colors |
|
|
|
| 50 |
Word Break |
|
|
|
| 52 |
Partition Equal Subset Sum |
|
|
|
| 53 |
String to Integer (atoi) |
|
|
|
| 54 |
Spiral Matrix |
|
|
|
| 55 |
Subsets |
|
|
|
| 56 |
Binary Tree Right Side View |
|
|
|
| 57 |
Longest Palindromic Substring |
|
|
|
| 58 |
Unique Paths |
|
|
|
| 59 |
Construct Binary Tree from Preorder and Inorder Traversal |
|
|
|