文件列表:

1D - DP on Jump Patterns (0, 2022-12-19)
1D - DP on Jump Patterns\DpFibonacci.cpp (1242, 2022-12-19)
1D - DP on Jump Patterns\Frog Jumps for 2 steps.cpp (1837, 2022-12-19)
1D - DP on Jump Patterns\Frog Jumps for K steps.cpp (1606, 2022-12-19)
1D - DP on Jump Patterns\Horse Robber 2.cpp (1037, 2022-12-19)
1D - DP on Jump Patterns\Maximum sum of non-adjacent elements(House Robber).cpp (1510, 2022-12-19)
1D - DP on Jump Patterns\N-stairs.cpp (485, 2022-12-19)
2D - DP on Grid (0, 2022-12-19)
2D - DP on Grid\Grid Unique Paths 2.cpp (2746, 2022-12-19)
2D - DP on Grid\Grid Unique Paths.cpp (2021, 2022-12-19)
2D - DP on Grid\Minimum Falling Path Sum.cpp (4579, 2022-12-19)
2D - DP on Grid\Minimum Path Sum.cpp (3065, 2022-12-19)
2D - DP on Grid\Ninja Training.cpp (3455, 2022-12-19)
2D - DP on Grid\Triangle.cpp (2062, 2022-12-19)
3D - DP on Grid + DP On stocks (0, 2022-12-19)
3D - DP on Grid + DP On stocks\Best Time to Buy & sell stocks 3.cpp (5688, 2022-12-19)
3D - DP on Grid + DP On stocks\Best Time to Buy & sell stocks 4.cpp (5451, 2022-12-19)
3D - DP on Grid + DP On stocks\Cherry Pickup.cpp (7572, 2022-12-19)
DP On Increasing Subsequences (0, 2022-12-19)
DP On Increasing Subsequences\Largest Divisible Subset(LIS).cpp (946, 2022-12-19)
DP On Increasing Subsequences\Longest Bitonic Subsequence.cpp (1301, 2022-12-19)
DP On Increasing Subsequences\Longest Increasing Subsequence(LIS)-Binary Search.cpp (554, 2022-12-19)
DP On Increasing Subsequences\Longest Increasing Subsequence(LIS).cpp (2870, 2022-12-19)
DP On Increasing Subsequences\Longest String chain.cpp (1673, 2022-12-19)
DP On Increasing Subsequences\Number of Longest Increasing Subsequences.cpp (948, 2022-12-19)
DP On Increasing Subsequences\Printing the Longest Increasing Subsequence(LIS).cpp (2199, 2022-12-19)
DP On Partitions(MCM) Pattern (0, 2022-12-19)
DP On Partitions(MCM) Pattern\Boolean Evaluation.cpp (3433, 2022-12-19)
DP On Partitions(MCM) Pattern\Burst Balloons.cpp (2121, 2022-12-19)
DP On Partitions(MCM) Pattern\Count square submatrices with all 1s.cpp (948, 2022-12-19)
DP On Partitions(MCM) Pattern\Matrix Chain Multiplication Memoization.cpp (1547, 2022-12-19)
DP On Partitions(MCM) Pattern\Matrix Chain Multiplication Tabulation.cpp (847, 2022-12-19)
DP On Partitions(MCM) Pattern\Maximum rectangle area with all 1s.cpp (1311, 2022-12-19)
DP On Partitions(MCM) Pattern\Minimum cost to cut the Stick.cpp (1429, 2022-12-19)
DP On Partitions(MCM) Pattern\Palindrome Partition.cpp (2046, 2022-12-19)
DP On Partitions(MCM) Pattern\Partition array for Maximum sum.cpp (1464, 2022-12-19)
DP on Stocks (0, 2022-12-19)
DP on Stocks\Best Time to Buy & Sell stock with Cooldown.cpp (3107, 2022-12-19)
DP on Stocks\Best Time to Buy & Sell stocks with Transaction Fees.cpp (1065, 2022-12-19)
... ...

# [DP Beginner to Advanced](https://github.com/singhkunal01/Dynamic-Programming) ‘¨’ - It contains all the codes which i coded during the learning of Dynamic Programming With All Possible Approaches Like - > Recursion \ > Memoization \ > Tabulation \ > Space Optimisation (Wherever Needed) | Type Of Questions/S-No. | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: |:---: | :---: | :---: | | **1D - DP on Jump Patterns** | [DP Fibonacci](https://bit.ly/3PM5DP9) | [Frog Jumps for 2 steps](https://bit.ly/3wmV9yU) | [Frog Jumps for K steps](https://bit.ly/3Cosy01) | [Horse Robber 2](https://bit.ly/3wqzshv) | [Maximum sum of non-adjacent elements(House Robber)](https://bit.ly/3PF8n0Q) | [N-stairs](https://bit.ly/3KeQ2GQ) | - | - | - | - | - | - | | **2D - DP on Grid** | [Grid Unique Paths 2](https://bit.ly/3Tce49t) | [Grid Unique Paths](https://bit.ly/3chP3cc) | [Minimum Falling Path Sum](https://bit.ly/3dPaBxm) | [Minimum Path Sum](https://bit.ly/3AIQqtT) | [Ninja Training](https://bit.ly/3AIQzNX) | [Triangle](https://bit.ly/3UWvlo8) | - | - | - | - | - | - | | **2D - DP on Subsequences** | [0-1 Knapsack](https://bit.ly/3AGvXWO) | [Coin change 2](https://bit.ly/3KeYHJj) |[Count Partitions With Given Difference](https://bit.ly/3bYGS4y) | [Count Subset with sum K](https://bit.ly/3SRVyCZ) | [Minimum Coins](https://bit.ly/3CtzxVA) | [Partition Equal subset sum](https://bit.ly/3CJBHAD) | [Partition a set into two subsets such that the difference of subset sums is minimum](https://bit.ly/3AGv14K)| [Rod Cutting Problem](https://bit.ly/3AJ1oQ7) | [Subset Sum Equals to Target](https://bit.ly/3R4dc4J) | [Target sum](https://bit.ly/3PMSYM2) | [Unbounded Knapsack](https://bit.ly/3AlfMwI) | | **2D - DP on Strings** | [Longest Common Subsequence](https://bit.ly/3dTbvZR) | [Print Longest Common Subsequence](https://bit.ly/3corIFM) | [Longest Common Substring](https://bit.ly/3PFZzYF) |[Longest Palindromic Substring](https://bit.ly/3KkQ7IX) | [Minimum Insertions To convert a string into Palindromic String](https://bit.ly/3wHR48O) | [Minimum Number of Insertion-Deletions to Make both strings Equal](https://bit.ly/3Kwt5Pw) | [Shortest Common Supersequence](https://bit.ly/3pUyZ3n) | (String Matching) [Distinct Subsequences](https://bit.ly/3RkIe8N) | (String Matching) [Edit Distance](https://bit.ly/3x2V18j) | (String Matching) [Wildcard Matching](https://bit.ly/3AxhcUR) | -| | **2D - DP on Stocks** | [Best Time to Buy & sell stock](https://bit.ly/3KVu9Na) | [Best Time to Buy & sell stocks 2](https://bit.ly/3RGyc1J) | [Best Time to Buy & sell stocks 3](https://bit.ly/3TJumGX) |[Best Time to Buy & sell stocks 4](https://bit.ly/3APhDds) | [Best Time to Buy & Sell stock with Cooldown](https://bit.ly/3eqcctV) | [Minimum Number of Insertion-Deletions to Make both strings Equal](https://bit.ly/3qaCkLZ) | - | - | - | - | - | | **2D - DP on Increasing Subsequences** | [Longest Increasing Subsequence(LIS)](https://bit.ly/3AVDO1H) | [Printing the Longest Increasing Subsequence(LIS)](https://bit.ly/3BuGu7N) | [Longest Increasing Subsequence(LIS)-Binary Search](https://bit.ly/3Qw2l2X) | [Largest Divisible Subset(LIS)](https://bit.ly/3xd7JkB) | [Longest String chain](https://bit.ly/3BwAcom) | [Longest Bitonic Subsequence](https://bit.ly/3qLf5Zj) | [Number of Longest Increasing Subsequences](https://bit.ly/3B9iplL) | - | - | - | - | | **2D - DP On Partitions(MCM) Pattern** | [Matrix Chain Multiplication Memoization](https://bit.ly/3fELMF6) | [Matrix Chain Multiplication Tabulation](https://bit.ly/3Rt1Bw8) | [Minimum cost to cut the Stick](https://bit.ly/3dXWK8t) | [Burst Balloons](https://bit.ly/3LZ01ke) | [Boolean Evaluation](https://bit.ly/3y9Jqo9) | [Palindrome Partition](https://bit.ly/3C1TAbF) | [Partition array for Maximum sum](https://bit.ly/3rp2Vp9) | [Maximum rectangle area with all 1s](https://bit.ly/3RoAlic) |[Count square submatrices with all 1s](https://bit.ly/3dUcbyA) | - | - | | **3D - DP on Grid** | (Jump Pattern) [Cherry Pickup](https://bit.ly/3dMhEXz) | (On stocks) [Best Time to Buy & sell stocks 2](https://bit.ly/3RGyc1J) | (On stocks) [Best Time to Buy & sell stocks 3](https://bit.ly/3TJumGX) |- | - | - | - | - | - | - | - |

< / > with ¤ by Kunal Singh

```diff @@ Star This Repository if You Like the codes & Explanation @@ ```

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：