Dynamic Programming Medium
| # | Title | Solution | Time | Space | Video |
|---|---|---|---|---|---|
| 64 | Minimum Path Sum | Python | O(N^2) | O(M*N) | Tutorial |
| 62 | Unique Paths | Python | O(N^2) | O(M*N) | Reference #64 |
| 55 | Jump Game | Python | O(N^2) | O(1) | TLE with DP/Use Greedy for O(N) Solution |
| 45 | Jump Game II | Python | O(N^2) | O(1) | TLE with DP/Use Greedy for O(N) Solution |
| 300 | Longest Increasing Subsequence | Python | O(N^2) | O(1) | Use Binary-Search for NlogN Solution |