A single file containing various DP problems
Path -> Dynamic-Programming\src\Main.java
Problems in order in the source code ->
- Optimised Fibonacci
- Climbing Stairs
- Climbing Stairs- Variable Steps
- Climbing Stairs- Minimum Steps Required
- Adjacent Houses Robbing
- Longest Increasing Subsequence
- Longest Increasing Subsequence sum
- Longest Bitonic Sequence
- Maximum Number of non-overlapping bridge
- Russian Doll/ Envelope Problem
- Palindromic Substring
- Least Costly Path
- Distinct Substring count
- Maximum Gold Extraction(2D DP)
- Subsets of Array acheiving a target sum
- 0-1 Knapsack Problem
- Unbounded Knapsack Problem
- Stock Problem 1
- Stock Problem 2
- Maximum Square Sub-Matrix problem
- Make two strings identical(incomplete)
- Arithmatic Arrays count
- Coin Change Combinations
- Coin Change Permutations
- Binary Strings with non-consecutive '0's
- Maximum Sum Subsequence in an array without any adjacent elements
- Minimum Paint Cost