Array Typical Programs
Concepts of DP:- [1] https://www.geeksforgeeks.org/dynamic-programming/ https://www.geeksforgeeks.org/maximum-product-subarray/ [1] https://www.geeksforgeeks.org/printing-maximum-sum-increasing-subsequence/ [2] https://www.geeksforgeeks.org/count-number-of-ways-to-cover-a-distance/ [3] https://www.geeksforgeeks.org/coin-change-dp-7/ [4] https://www.geeksforgeeks.org/0-1-knapsack-problem-dp-10/ [5] https://www.geeksforgeeks.org/cutting-a-rod-dp-13/ [6] https://www.geeksforgeeks.org/two-water-jug-puzzle/ [7] https://www.geeksforgeeks.org/count-ways-reach-nth-stair/ [8] https://www.geeksforgeeks.org/longest-palindromic-subsequence-dp-12/ [9] https://www.geeksforgeeks.org/count-possible-paths-top-left-bottom-right-nxm-matrix/ [10] https://www.geeksforgeeks.org/count-strings-can-formed-using-b-c-given-constraints/ [11] https://www.geeksforgeeks.org/count-the-number-of-ways-to-traverse-a-matrix/ [12] https://www.geeksforgeeks.org/matrix-chain-multiplication-a-on2-solution/