└── Grokking Dynamic Programming Patterns for Coding Interviews.md /Grokking Dynamic Programming Patterns for Coding Interviews.md: -------------------------------------------------------------------------------- 1 | # Grokking Dynamic Programming Patterns for Coding Interviews 2 | 3 | 4 | 5 | ## Pattern 1: 0/1 Knapsack 6 | 7 | 1. [0/1 Knapsack Problem](https://www.geeksforgeeks.org/0-1-knapsack-problem-dp-10/) 8 | 2. [Equal Subset Sum Partition](https://www.geeksforgeeks.org/partition-problem-dp-18/) 9 | 3. [Subset Sum](https://www.geeksforgeeks.org/subset-sum-problem-dp-25/) 10 | 4. [Minimum Subset Sum Difference](https://www.geeksforgeeks.org/partition-a-set-into-two-subsets-such-that-the-difference-of-subset-sums-is-minimum/) 11 | 5. [Count of subset sum](https://www.geeksforgeeks.org/perfect-sum-problem-print-subsets-given-sum/) 12 | 6. [Target Sum (Leetcode)](https://leetcode.com/problems/target-sum/solution/) 13 | 14 | 15 | 16 | ## Pattern 2: Unbounded Knapsack 17 | 18 | 1. [Unbounded Knapsack](https://www.geeksforgeeks.org/unbounded-knapsack-repetition-items-allowed/) 19 | 2. [Rod Cutting](https://www.geeksforgeeks.org/cutting-a-rod-dp-13/) 20 | 3. [Coin Change](https://www.geeksforgeeks.org/coin-change-dp-7/) 21 | 4. [Minimum Coin Change](https://www.geeksforgeeks.org/find-minimum-number-of-coins-that-make-a-change/) 22 | 5. [Maximum Ribbon Cut](https://www.geeksforgeeks.org/maximum-number-segments-lengths-b-c/) 23 | 24 | 25 | 26 | ## Pattern 3: Fibonacci Numbers 27 | 28 | 1. [Fibonacci Number](https://www.geeksforgeeks.org/program-for-nth-fibonacci-number/) 29 | 2. [Staircase](https://www.geeksforgeeks.org/count-ways-reach-nth-stair/) 30 | 3. [Number divisors](https://www.geeksforgeeks.org/total-number-divisors-given-number/) - // TODO 31 | 4. [Minimum jumps to reach end](https://www.geeksforgeeks.org/minimum-number-of-jumps-to-reach-end-of-a-given-array/) 32 | 5. Minimum jumps with fee - // TODO 33 | 6. [House Thief](https://www.geeksforgeeks.org/find-maximum-possible-stolen-value-houses/) 34 | 35 | 36 | 37 | ## Pattern 4: Palindromic Subsequence 38 | 39 | 1. [Longest Pallindromic Subsequence](https://www.geeksforgeeks.org/longest-palindromic-subsequence-dp-12/) 40 | 2. [Longest Pallindromic Substring](https://www.geeksforgeeks.org/longest-palindrome-substring-set-1/) 41 | 3. [Count of Pallindromic Substrings](https://www.geeksforgeeks.org/count-palindrome-sub-strings-string/) 42 | 4. [Minimum deletions to make a string pallindrome](https://www.geeksforgeeks.org/minimum-number-deletions-make-string-palindrome/) 43 | 5. [Pallindromic Partitioning](https://www.geeksforgeeks.org/palindrome-partitioning-dp-17/) 44 | 45 | 46 | 47 | ## Pattern 5: Longest Common Substring 48 | 49 | 1. [Longest Common Substring](https://www.geeksforgeeks.org/longest-common-substring-dp-29/) 50 | 2. [Longest Common Subsequence](https://www.geeksforgeeks.org/longest-common-subsequence-dp-4/) 51 | 3. [Minimum Deletions and Insertions to Transform a String into another](https://www.geeksforgeeks.org/minimum-number-deletions-insertions-transform-one-string-another/) 52 | 4. [Longest Increasing Subsequence](https://www.geeksforgeeks.org/longest-increasing-subsequence-dp-3/) 53 | 5. [Maximum Sum Increasing Subsequence](https://www.geeksforgeeks.org/maximum-sum-increasing-subsequence-dp-14/) 54 | 6. [Shortest Common Supersequence](https://www.geeksforgeeks.org/shortest-common-supersequence/) 55 | 7. [Minimum deletions to make sequence sorted](https://www.geeksforgeeks.org/minimum-number-deletions-make-sorted-sequence/) 56 | 8. [Longest repeating subsequence](https://www.geeksforgeeks.org/longest-repeating-subsequence/) 57 | 9. Subsequence Pattern Matching - // TODO 58 | 10. [Longest Bitonic Subsequence](https://www.geeksforgeeks.org/longest-bitonic-subsequence-dp-15/) 59 | 11. [Longest Alternating Subsequence](https://www.geeksforgeeks.org/longest-alternating-subsequence/) 60 | 12. [Edit Distance](https://www.geeksforgeeks.org/edit-distance-dp-5/) 61 | 13. [String Interleaving](https://www.geeksforgeeks.org/find-if-a-string-is-interleaved-of-two-other-strings-dp-33/) 62 | 14. ​ --------------------------------------------------------------------------------