Scribd
Upload
5 views1 page

DP Memoization Problems Summary

The document outlines a set of dynamic programming problems that can be solved using memoization, including Fibonacci numbers, Longest Common Subsequence, and the 0/1 Knapsack Problem. Each problem includes a brief explanation of the approach, along with its time and space complexity. Overall, it serves as a guide for implementing memoization in various algorithmic challenges.

Uploaded by

Shailesh kumar Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views1 page

DP Memoization Problems Summary

The document outlines a set of dynamic programming problems that can be solved using memoization, including Fibonacci numbers, Longest Common Subsequence, and the 0/1 Knapsack Problem. Each problem includes a brief explanation of the approach, along with its time and space complexity. Overall, it serves as a guide for implementing memoization in various algorithmic challenges.

Uploaded by

Shailesh kumar Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Dynamic Programming using Memoization - Problem Set

1. Fibonacci Numbers

Problem: Find the nth Fibonacci number using memoization.


Explanation: Recursive approach is optimized by storing intermediate results.
Complexity: Time: O(n), Space: O(n)

2. Longest Common Subsequence (LCS)

Problem: Find LCS length of two strings using memoization.


Explanation: Use 2D dp array to avoid redundant subproblem calls.
Complexity: Time: O(m*n), Space: O(m*n)

3. 0/1 Knapsack Problem

Problem: Maximize value within a weight limit using memoization.


Explanation: Use dp[n][W] to store max value up to item n with weight W.
Complexity: Time: O(n*W), Space: O(n*W)

4. Grid Unique Paths

Problem: Count all unique paths from top-left to bottom-right of grid.


Explanation: At each point, total paths = from top + from left.
Complexity: Time: O(m*n), Space: O(m*n)

5. Matrix Chain Multiplication

Problem: Minimize matrix multiplication cost.


Explanation: Try all parenthesizations using dp[i][j].
Complexity: Time: O(n^3), Space: O(n^2)

6. Palindrome Partitioning

Problem: Minimize cuts to partition string into palindromes.


Explanation: Check palindromes and cache min cuts.
Complexity: Time: O(n^2), Space: O(n)

7. Coin Change - Min Coins

Problem: Find minimum coins to make amount.


Explanation: Try all coins and cache the min.
Complexity: Time: O(n*amount), Space: O(amount)

8. Subset Sum

Problem: Check if a subset with a given sum exists.


Explanation: Recursively include/exclude elements.
Complexity: Time: O(n*sum), Space: O(n*sum)

You might also like