Those who cannot remember the past are condemned to repeat it - Dynamic Programming
Parent Problem : Fibonacci.
SubProblems :
- Minimum Steps To One
- Staircase
- Reach a given Score.
- Count number of hops.
Parent Problem : Longest Common SubSequence
SubProblems :
- Longest Common SubString..
- Longest Repeating SubSequence.
- Longest Palindrome Subsequence.
- Uncrossed Lines(LeetCode).
- Print LCS.
- Shortest Common SuperSequence.
- Count All Pallindromic SubSequence.
- Edit Distance.
- Count Distinct Occcurences
- Minimum Deletion to make string pallindrome.
- Minimum Insertions And Deletion to Convert a String.
- Maximum length of pairs.
- Minimum Ascii Sum deletion To Make two Strings equal.
- Maximum Dot Product of Subsequences(Leetcode).