LeetCode Python

# LeetCode Python ## Ongoing 0207 Course Schedule ## Order list | No. | Problem | Difficulty | Solution | | --- | :------ | :--------- | :------- | | 0001 | Two Sum | Easy | 3) Hashmap | | 0011 | Container With Most Water | Medium (M+) | Two pointers | | 0015 | Three Sum | Medium (M) | 2) 3) Two pointers | | 0033 | Search in Rotated Sorted Array | Medium (M) | 1) 2) 3) Binary search | | 0039 | Combination Sum | Medium | 1) Dynamic programming 2) 3) DFS | | 0053 | Maximum Subarray | Medium (E+) | 3) Dynamic programming (Kadane's algorithm) | | 0055 | Jump Game | Medium (E+) | 1) Greedy Algorithm | | 0062 | Unique Paths | Medium | 1) 2) Dynamic programming | | 0070 | Climbing Stairs | Easy | Dynamic programming | | 0091 | Decode Ways | Medium (M) | 1) Dynamic programming 2) DP + DFS | | 0121 | Best Time to Buy and Sell Stock | Easy | 2) Two pointers | | 0133 | Clone Graph | Medium (M+) | 1) Hashmap 2) DFS + Hashmap 3) BFS + Hashmap | | 0136 | Single Number | Easy (M) | 2) Bitwise | | 0139 | Word Break | Medium (M+) | 1) Dynamic programming 2) Trie | | 0152 | Maximum Product Subarray | Medium (M+) | 2) Dynamic programming | | 0153 | Find Minimum in Rotated Sorted Array | Medium (M+) | 2) 3) 4) 5) Binary search | | 0190 | Reverse Bits | Easy | 1) 2) Bitwise | | 0191 | Number of One Bits | Easy | 1) 2) 3) Bitwise | | 0198 | House Robber | Medium(E) | 1) 2) 3) Dynamic programming | | 0202 | Happy Number | Easy | 1) Unhappy cycle 2) Cycle finding: Floyd's Algorithm: Tortoise and Hare Algorithm 3) Hashmap | | 0213 | House Robber II | Medium(M+) | 1) 2) Dynamic programming | | 0217 | Contains Duplicate | Easy | 1) Sort 2) Hashmap | | 0238 | Product of Array Except Self | Medium | 2) 3) Prefix, postfix | | 0268 | Missing Number | Easy (H-) | 1) 2) Bitwise | | 0283 | Move Zeroes | Easy (M) | 2) One pointer 3) 4) Two pointers | | 0300 | Longest Increasing Subsequence | Medium (M+) | 1) 2) 3) Dynamic programming 4) Greedy Algorithm | | 0322 | Coin Change | Medium (M) | 1) Dynamic programming | | 0338 | Counting Bits | Easy | 2) 4) Bitwise 3) 7) Dynamic programming 5) DP + Bitwise(BIT) 6) DP + Bitwise | | 0371 | Sum of Two Integers | Medium (H) | 1) Bitwise | | 0509 | Fibonacci Number | Easy | Dynamic programming | | 0981 | Time Based Key-Value Store | Medium | 1) Binary search 2) ? | | 1143 | Longest Common Subsequence | Medium (M) | 1) 2) Dynamic programming | | | | | | ## Topic list ### BFS | No. | Problem | Difficulty | Solution | | --- | :------ | :--------- | :------- | | 0133 | Clone Graph | Medium (M+) | 1) Hashmap 2) DFS + Hashmap 3) BFS + Hashmap | ### Binary Search | No. | Problem | Difficulty | Solution | | --- | :------ | :--------- | :------- | | 0033 | Search in Rotated Sorted Array | Medium (M) | 1) 2) 3) Binary search | | 0153 | Find Minimum in Rotated Sorted Array | Medium (M+) | 2) 3) 4) 5) Binary search | | 0981 | Time Based Key-Value Store | Medium | 1) Binary search 2) ? | ### Bitwise | No. | Problem | Difficulty | Solution | | --- | :------ | :--------- | :------- | | 0136 | Single Number | Easy (M) | 2) Bitwise | | 0190 | Reverse Bits | Easy | 1) 2) Bitwise | | 0191 | Number of One Bits | Easy | 1) 2) 3) Bitwise | | 0268 | Missing Number | Easy (H-) | 1) 2) Bitwise | | 0338 | Counting Bits | Easy | 2) 4) Bitwise 3) 7) Dynamic programming 5) DP + Bitwise(BIT) 6) DP + Bitwise | | 0371 | Sum of Two Integers | Medium (H) | 1) Bitwise | ### DFS | No. | Problem | Difficulty | Solution | | --- | :------ | :--------- | :------- | | 0039 | Combination Sum | Medium | 1) Dynamic programming 2) 3) DFS | | 0091 | Decode Ways | Medium (M) | 1) Dynamic programming 2) DP + DFS | | 0133 | Clone Graph | Medium (M+) | 1) Hashmap 2) DFS + Hashmap 3) BFS + Hashmap | ### Dynamic Programming | No. | Problem | Difficulty | Solution | | --- | :------ | :--------- | :------- | | 0039 | Combination Sum | Medium | 1) Dynamic programming 2) 3) DFS | | 0053 | Maximum Subarray | Medium (E+) | 3) Dynamic programming (Kadane's algorithm) | | 0062 | Unique Paths | Medium | 1) 2) Dynamic programming | | 0070 | Climbing Stairs | Easy | Dynamic programming | | 0091 | Decode Ways | Medium (M) | 1) Dynamic programming 2) DP + DFS | | 0139 | Word Break | Medium (M+) | 1) Dynamic programming 2) Trie | | 0152 | Maximum Product Subarray | Medium (M+) | 1) 2) Dynamic programming | | 0198 | House Robber | Medium(E) | 1) 2) 3) Dynamic programming | | 0213 | House Robber II | Medium(M+) | 1) 2) Dynamic programming | | 0300 | Longest Increasing Subsequence (M+) | Medium | 1) 2) 3) Dynamic programming 4) Greedy Algorithm | | 0322 | Coin Change | Medium (M) | 1) Dynamic programming | | 0338 | Counting Bits | Easy | 2) 4) Bitwise 3) 7) Dynamic programming 5) DP + Bitwise(BIT) 6) DP + Bitwise | | 0509 | Fibonacci Number | Easy | Dynamic programming | | 1143 | Longest Common Subsequence | Medium (M) | 1) 2) Dynamic programming | ### Greedy Algorithm | No. | Problem | Difficulty | Solution | | --- | :------ | :--------- | :------- | | 0055 | Jump Game | Medium (E+) | 1) Greedy Algorithm | | 0300 | Longest Increasing Subsequence | Medium (M+) | 1) 2) 3) Dynamic programming 4) Greedy Algorithm | ### Hash | No. | Problem | Difficulty | Solution | | --- | :------ | :--------- | :------- | | 0001 | Two Sum | Easy | 3) Hashmap | | 0133 | Clone Graph | Medium (M+) | 1) Hashmap 2) DFS + Hashmap 3) BFS + Hashmap | | 0202 | Happy Number | Easy | 1) Unhappy cycle 2) Cycle finding: Floyd's Algorithm: Tortoise and Hare Algorithm 3) Hashmap | | 0217 | Contains Duplicate | Easy | 1) Sort 2) Hashmap | ### Pointer #### One Pointer | No. | Problem | Difficulty | Solution | | --- | :------ | :--------- | :------- | | 0283 | Move Zeroes | Easy (M) | 2) One pointer 3) 4) Two pointers | #### Two Pointers | No. | Problem | Difficulty | Solution | | --- | :------ | :--------- | :------- | | 0011 | Container With Most Water | Medium (M+) | Two pointers | | 0015 | Three Sum | Medium (M) | 2) 3) Two pointers | | 0121 | Best Time to Buy and Sell Stock | Easy | 2) Two pointers | | 0283 | Move Zeroes | Easy (M) | 2) One pointer 3) 4) Two pointers | ### Others | No. | Problem | Difficulty | Solution | | --- | :------ | :--------- | :------- | | 0202 | Happy Number | Easy | 1) Unhappy cycle 2) Cycle finding: Floyd's Algorithm: Tortoise and Hare Algorithm 3) Hashmap | | 0238 | Product of Array Except Self | Medium | 2) 3) Prefix, postfix | ### TBD ref: [Algorithm - Theory](https://hackmd.io/HNTS1fpvRtqjpGlUiQEV3g) [GitHub](https://github.com/jaleo73422/LeetCode_Python) [Blind 75](https://leetcode.com/discuss/general-discussion/460599/blind-75-leetcode-questions) [NeetCode YouTube](https://www.youtube.com/c/NeetCode/playlists) [wisdompeak LeetCode in GitHub](https://github.com/wisdompeak/LeetCode) [JIAKAOBO LeetCode](https://www.jiakaobo.com/leetcode.html) [Grind 75](https://leetcode.com/list/oxsc18br/) [Grind 169](https://leetcode.com/list/ed66mkcj/) [Coding interview study plan - what to study and practice based on time left](https://www.techinterviewhandbook.org/coding-interview-study-plan/)