| # | Title | Level | Time | Space | Tags | Note |
|---|---|---|---|---|---|---|
| 57 | Insert Interval | Medium | O(N) | O(N) | Array, Matrix, Dynamic Programming | DP (Merging Intervals) |
| 62 | Unique Paths | Medium | O(M*N) | O(M*N) | Array, Matrix, Dynamic Programming | DP (Distinct Ways) |
| 64 | Minimum Path Sum | Medium | O(N*M) | O(N*M) | Array, Matrix, Dynamic Programming | DP (Min - Max) |
| 70 | Climbing Stairs | Easy | O(N) | O(N) | Dynamic Programming | DP (Min - Max) |
| 75 | Sort Colors | Medium | O(N) | O(N) | Array, Two Pointers, Sorting | DP (Min - Max) |
| 120 | Triangle | Medium | O(N^2) | O(N^2) | Array, Dynamic Programming | DP (Min - Max) |
| 198 | House Robber | Medium | O(N) | O(N) | Array, Dynamic Programming | Recursion |
| 200 | Number of Islands | Medium | O(R*C) | O(R*C) | Array, Depth-First Search, Breadth-First Search, Union Find, Matrix | DP |
| 209 | Minimum Size Subarray Sum | Medium | O(N^2) | O(1) | Array, Binary Search, Sliding Window, Prefix Sum | |
| 221 | Maximal Square | Medium | O(R*C) | O(1) | Array, Dynamic Programming, Matrix | DP (Min - Max) |
| 279 | Perfect Squares | Medium | O(N*log(N)) | O(N) | Math, Dynamic Programming, BFS | DP (Min - Max) |
| 322 | Coin Change | Medium | O(A*N) | O(A) | Array, Dynamic Programming, Breadth-First Search | DP (Min - Max) |
| 377 | Combination Sum IV | Medium | O(N*T) | O(T) | Array, Dynamic Programming | DP (Distinct Ways) |
| 416 | Partition Equal Subset Sum | Medium | O(N*T) | O(T) | Array, Dynamic Programming | DP (Distinct Ways) |
| 474 | Ones And Zeros | Medium | O(M*N*L) | O(M*N*L) | Array, String, Dynamic Programming | DP (Min - Max) |
| 494 | Target Sum | Medium | O(N*T) | O(T) | Dynamic Programming | DP (Distinct Ways) |
| 650 | 2 Keys Keyboard | Medium | O(N) | O(N) | Math, Dynamic Programming | DP (Min - Max) |
| 697 | Degree Of An Array | Easy | O(N) | O(N) | Array, Hash Table | |
| 724 | Find Pivot Index | Easy | O(N) | O(1) | Array, Prefix Sum | Prefix Sum |
| 764 | Min Cost Climbing Stairs | Easy | O(N) | O(N) | Array, Dynamic Programming | DP (Min - Max) |
| 808 | Soup Servings | Medium | O(N^2) | O(N^2) | Math, Dynamic Programming, Probability and Statistics | DP (Distinct Ways) |
| 875 | Koko Eating Bananas | Medium | O(N*log(M)) | O(1) | Array, Binary Search | |
| 931 | Minimum Falling Path Sum | Medium | O(N*M) | O(N*M) | Array, Matrix, Dynamic Programming | DP (Min - Max) |
| 983 | Minimum Cost For Tickets | Medium | O(365) | O(365) | Array, Dynamic Programming | DP (Min - Max) |
| 1049 | Last Stone Weight II | Medium | O(N*S) | O(S) | Array, Dynamic Programming | DP (Min - Max) |
| 1130 | Minimum Cost Tree From Leaf Values | Medium | O(N) | O(N) | Array, Dynamic Programming, Stack, Greedy, Monotonic Stack | DP (Merging Intervals), Stack |
| 1283 | Find the Smallest Divisor Given a Threshold | Medium | O(N*logN) | O(1) | Array, Binary Search | |
| 1442 | Count Triplets That Can Form Two Arrays of Equal XOR | Medium | O(N) | O(N) | Array, Hash Table, Math, Bit Manipulation, Prefix Sum | |
| 2270 | Number Of Ways To Split Array | Medium | O(N) | O(1) | Array, Prefix Sum |
huyjs9 / leetcode-solutions Goto Github PK
View Code? Open in Web Editor NEWThis repository is the list of problems I solved on LeetCode
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent