educative.io

Grokking Dynamic Programming Patterns for Coding Interviews (Design Gurus)


Pattern 3: Fibonacci Numbers - Fibonacci numbers Have questions about Fibonacci numbers? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5740874747084800). Pattern 4: Palindromic Subsequence - Longest Palindromic Subsequence Have questions about Longest Palindromic Subsequence? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5748119283171328). Pattern 5: Longest Common Substring - Longest Common Subsequence Have questions about Longest Common Subsequence? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5657535201673216). Pattern 5: Longest Common Substring - Shortest Common Super-sequence Have questions about Shortest Common Super-sequence? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5700866052980736). Pattern 5: Longest Common Substring - Longest Increasing Subsequence Have questions about Longest Increasing Subsequence? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5733679603122176). Introduction - What is Dynamic Programming? Have questions about What is Dynamic Programming?? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5744017589403648). Pattern 5: Longest Common Substring - Minimum Deletions to Make a Sequence Sorted Have questions about Minimum Deletions to Make a Sequence Sorted? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5681461390737408). Pattern 1: 0/1 Knapsack - Count of Subset Sum Have questions about Count of Subset Sum? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5712536552865792). Pattern 4: Palindromic Subsequence - Minimum Deletions in a String to make it a Palindrome Have questions about Minimum Deletions in a String to make it a Palindrome? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5165000163328000). Pattern 5: Longest Common Substring - Longest Bitonic Subsequence Have questions about Longest Bitonic Subsequence? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5755034180517888). Appendix - Other courses Have questions about Other courses? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5686230951919616). Pattern 5: Longest Common Substring - Longest Common Substring Have questions about Longest Common Substring? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5750031617359872). Pattern 3: Fibonacci Numbers - Staircase Have questions about Staircase? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5649202965118976). Appendix - Contact Us Have questions about Contact Us? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5763568280535040). Pattern 1: 0/1 Knapsack - Target Sum Have questions about Target Sum? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5679413765079040). Pattern 4: Palindromic Subsequence - Longest Palindromic Substring Have questions about Longest Palindromic Substring? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5661601461960704). Pattern 2: Unbounded Knapsack - Unbounded Knapsack Have questions about Unbounded Knapsack? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5745865499082752). Pattern 1: 0/1 Knapsack - 0/1 Knapsack Have questions about 0/1 Knapsack? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5666387129270272). Pattern 5: Longest Common Substring - Strings Interleaving Have questions about Strings Interleaving? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5689922476310528). Pattern 1: 0/1 Knapsack - Subset Sum Have questions about Subset Sum? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5646239437684736). Pattern 1: 0/1 Knapsack - Minimum Subset Sum Difference Have questions about Minimum Subset Sum Difference? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5695872079757312). Pattern 2: Unbounded Knapsack - Minimum Coin Change Have questions about Minimum Coin Change? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5668753656250368). Pattern 4: Palindromic Subsequence - Palindromic Partitioning Have questions about Palindromic Partitioning? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5698125863845888). Pattern 3: Fibonacci Numbers - Minimum jumps with fee Have questions about Minimum jumps with fee? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5717424225648640). Pattern 5: Longest Common Substring - Subsequence Pattern Matching Have questions about Subsequence Pattern Matching? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5718922095493120). Pattern 5: Longest Common Substring - Edit Distance Have questions about Edit Distance? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5665054615666688). Pattern 1: 0/1 Knapsack - Equal Subset Sum Partition Have questions about Equal Subset Sum Partition? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5752754626625536). Pattern 5: Longest Common Substring - Maximum Sum Increasing Subsequence Have questions about Maximum Sum Increasing Subsequence? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5634208160546816). Pattern 2: Unbounded Knapsack - Rod Cutting Have questions about Rod Cutting? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5729201025974272). Pattern 2: Unbounded Knapsack - Maximum Ribbon Cut Have questions about Maximum Ribbon Cut? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5709198289534976). Pattern 5: Longest Common Substring - Longest Repeating Subsequence Have questions about Longest Repeating Subsequence? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5653294995210240). Pattern 3: Fibonacci Numbers - House thief Have questions about House thief? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5676982813589504). Pattern 5: Longest Common Substring - Minimum Deletions & Insertions to Transform a String into another Have questions about Minimum Deletions & Insertions to Transform a String into another? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5704980631650304). Pattern 3: Fibonacci Numbers - Minimum jumps to reach the end Have questions about Minimum jumps to reach the end? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5685057352105984). Pattern 5: Longest Common Substring - Longest Alternating Subsequence Have questions about Longest Alternating Subsequence? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5643365030821888). Pattern 4: Palindromic Subsequence - Count of Palindromic Substrings Have questions about Count of Palindromic Substrings? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5727950116749312). Pattern 3: Fibonacci Numbers - Number factors Have questions about Number factors? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5724313353191424). Pattern 2: Unbounded Knapsack - Coin Change Have questions about Coin Change? Go for it! View the lesson [here](https://www.educative.io/collection/page/5668639101419520/5633779737559040/5707648880082944).
About the Grokking Dynamic Programming Patterns for Coding Interviews (Design Gurus) category [Grokking Dynamic Programming Patterns for Coding Interviews (Design Gurus)] (1)
I can't tell the difference of the code between unbounded question and 0/1 knapback [Pattern 2: Unbounded Knapsack - Unbounded Knapsack] (1)
For the DP solution, Why startIndex start from the last character of the string [Pattern 4: Palindromic Subsequence - Longest Palindromic Subsequence] (1)
O (n + m) solution [Pattern 5: Longest Common Substring - Longest Common Substring] (1)
Not optimal memoisation solution [Pattern 5: Longest Common Substring - Strings Interleaving] (1)
3rd example doesn't confirm to the problem statement [Pattern 5: Longest Common Substring - Longest Repeating Subsequence] (1)
Error in the recursive formula [Pattern 5: Longest Common Substring - Subsequence Pattern Matching] (1)
O(n log n) solution [Pattern 5: Longest Common Substring - Longest Increasing Subsequence] (1)
Please add some dynamic programming related to matrix [Grokking Dynamic Programming Patterns for Coding Interviews (Design Gurus)] (2)
Example 2 data error [Pattern 3: Fibonacci Numbers - Number factors] (2)
In the dp solution, handling only one number soluton [Pattern 1: 0/1 Knapsack - Equal Subset Sum Partition] (3)
For basic solution, can we just compare c2 and c3 without c1? [Pattern 4: Palindromic Subsequence - Longest Palindromic Substring] (3)
Other DP problems [Appendix - Contact Us] (1)
This fails with negative numbers. How to implement when -ve numbers exists [Pattern 1: 0/1 Knapsack - Equal Subset Sum Partition] (2)
Can we solve this problem too with Space complexity of O(n) like the Knapsack problem? [Pattern 1: 0/1 Knapsack - Equal Subset Sum Partition] (1)
The code provides here fails for the test case [1,2,5] expected is false but the code returns true [Pattern 1: 0/1 Knapsack - Equal Subset Sum Partition] (1)
Topic Correction - I believe this must be LIS instead of LDS! [Pattern 5: Longest Common Substring - Longest Bitonic Subsequence] (7)
What are the correct start points and index, 0 or 1? [Pattern 3: Fibonacci Numbers - Minimum jumps with fee] (1)
Time complexity for basic solution [Pattern 5: Longest Common Substring - Longest Common Subsequence] (2)
How to calculate the basic solution time complexity and Top-down array question? [Pattern 5: Longest Common Substring - Longest Common Substring] (2)
The problem is quite similar to the LCS not LIS [Pattern 5: Longest Common Substring - Shortest Common Super-sequence] (2)
Count of Palindromic Substrings [Pattern 4: Palindromic Subsequence - Count of Palindromic Substrings] (6)
Brute force solution complexity [Pattern 4: Palindromic Subsequence - Longest Palindromic Subsequence] (6)
Bottom-up solution - why do we compare dp[end] itself with dp[start]+1? [Pattern 3: Fibonacci Numbers - Minimum jumps to reach the end] (1)
What's the meaning of Integer.MAX_VALUE in three solutions? [Pattern 2: Unbounded Knapsack - Minimum Coin Change] (1)
Why space complexity is O(2^n) in Basic Solution? [Pattern 2: Unbounded Knapsack - Unbounded Knapsack] (1)
Why do we create array length as n + 1 instead of n? [Introduction - What is Dynamic Programming?] (1)
Is it correct to exclude the pivot element [Pattern 5: Longest Common Substring - Longest Bitonic Subsequence] (3)
Time complexity [Pattern 5: Longest Common Substring - Edit Distance] (2)
The time complexity of the basic solution should be exponential ie O(2^n) [Pattern 3: Fibonacci Numbers - Minimum jumps to reach the end] (6)