Dynamic Programming
- Get Fibonacci Number | DP Introduction
- Total Number of ways to reach nth Stair using step 1, 2 or 3
- Minimum jumps to reach nth Stair using 1, 2 or 3 steps
- Get Longest Increasing Subsequence Length
- Maximum Sum Increasing Subsequence
- Longest Common Subsequence
- Longest common Substring
- Edit Distance (Minimum operations required to transform String – 1 to String – 2)
- Longest Palindrome Subsequence
- Longest Palindromic Substring
- 0/1 Knapsack Problem | Get max profit for given weights & their profit for a capacity
- Subset Sum Problem (If there exists a subset with sum equal to given sum)
- Check if Equal sum partition exists of given array
- Partition Set into two Subset such that Subset Sum have Minimum Difference
- Unbounded Knapsack | Get Max Profit for a given capacity
- Coin Change Problem | Total ways to make Sum from given coins
- Minimum Coin Change Problem
- Rod Cutting Problem
- Min jumps to reach till the end
- Count of subsets with Sum equal to given Sum
- Target Sum Problem
Hello Sir, I really appreciate all the efforts that you put in explaining all the coding interview problems. Thank you so much! I’m very grateful for all your videos. Please continue posting explanation videos and codes of challenging interview coding problems related to DP and other algorithmic paradigms. All of us genuinely appreciate your hard work! In order to support you I regulary visit your website and click on all the ads . Thank you so much Sir! Please keep posting such amazing content!