A collection of LeetCode problems solved using Dynamic Programming pattern techniques, explanations, and complexity analysis.
| # | Problem | Language | Time | Space | Explanation |
|---|---|---|---|---|---|
| 392 | Is Subsequence | Python | O(n) | O(n) | Explanation |
| 521 | Longest Uncommon Subsequence I | Python | O(n) | O(n) | Explanation |
| 594 | Longest Harmonious Subsequence | Python | O(n) | O(n) | Explanation |
| 674 | Longest Continuous Increasing Subsequence | Python | O(n) | O(n) | Explanation |
| 1332 | Remove Palindromic Subsequences | Python | O(n) | O(n) | Explanation |
| 1403 | Minimum Subsequence in Non-Increasing Order | Python | O(n) | O(n) | Explanation |
| 1971 | Find if Path Exists in Graph | JavaScript | O(n) | O(n) | Explanation |
| # | Problem | Language | Time | Space | Explanation |
|---|---|---|---|---|---|
| 486 | Predict the Winner | C++ | O(n) | O(n) | Explanation |
| 1140 | Stone Game II | C++ | O(n) | O(n) | Explanation |
| 2770 | Maximum Number of Jumps to Reach the Last Index | C++ | O(n) | O(n) | Explanation |
| 3702 | Longest Subsequence With Non-Zero Bitwise XOR | C++ | O(n) | O(n) | Explanation |
| # | Problem | Language | Time | Space | Explanation |
|---|---|---|---|---|---|
| 10 | Regular Expression Matching | JavaScript | O(n) | O(n) | Explanation |
| 115 | Distinct Subsequences | JavaScript | O(n) | O(n) | Explanation |
| 940 | Distinct Subsequences II | JavaScript | O(n) | O(n) | Explanation |
| 1301 | Number of Paths with Max Score | PHP | O(n) | O(n) | Explanation |
| 1340 | Jump Game V | C++ | O(n) | O(n) | Explanation |
| 1406 | Stone Game III | PHP | O(n) | O(n) | Explanation |
| 1510 | Stone Game IV | TypeScript | O(n) | O(n) | Explanation |
| 3312 | Sorted GCD Pair Queries | PHP | O(n) | O(n) | Explanation |
| 3336 | Find the Number of Subsequences With Equal GCD | PHP | O(n) | O(n) | Explanation |