Scribd
Upload
6 views3 pages

Dynamic Programming Master List Checklist

The document outlines various dynamic programming problems categorized into different patterns, including 1D DP, 2D DP, Knapsack, Palindromic Subsequence, Longest Increasing Subsequence, Matrix Chain Multiplication, Partition DP, Problems on Trees, Digit DP, and Bitmasking DP. Each category lists specific problems along with their corresponding links for further exploration. This serves as a comprehensive guide for practicing dynamic programming techniques.

Uploaded by

2k23.cs2313825
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views3 pages

Dynamic Programming Master List Checklist

The document outlines various dynamic programming problems categorized into different patterns, including 1D DP, 2D DP, Knapsack, Palindromic Subsequence, Longest Increasing Subsequence, Matrix Chain Multiplication, Partition DP, Problems on Trees, Digit DP, and Bitmasking DP. Each category lists specific problems along with their corresponding links for further exploration. This serves as a comprehensive guide for practicing dynamic programming techniques.

Uploaded by

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

Dynamic Programming Master Problem

List (With Patterns)


1. 1D DP
 ☐ ☐ ☐ ☐ ☐ Fibonacci Numbers - https://leetcode.com/problems/fibonacci-
number/
 ☐ ☐ ☐ ☐ ☐ Climbing Stairs - https://leetcode.com/problems/climbing-stairs/
 ☐ ☐ ☐ ☐ ☐ House Robber - https://leetcode.com/problems/house-robber/
 ☐ ☐ ☐ ☐ ☐ Min Cost Climbing Stairs - https://leetcode.com/problems/min-cost-
climbing-stairs/
 ☐ ☐ ☐ ☐ ☐ Decode Ways - https://leetcode.com/problems/decode-ways/
 ☐ ☐ ☐ ☐ ☐ Longest Increasing Subsequence -
https://leetcode.com/problems/longest-increasing-subsequence/
 ☐ ☐ ☐ ☐ ☐ Paint Fence - https://leetcode.com/problems/paint-fence/

2. 2D DP
 ☐ ☐ ☐ ☐ ☐ Unique Paths - https://leetcode.com/problems/unique-paths/
 ☐ ☐ ☐ ☐ ☐ Minimum Path Sum - https://leetcode.com/problems/minimum-path-
sum/
 ☐ ☐ ☐ ☐ ☐ Longest Common Subsequence -
https://leetcode.com/problems/longest-common-subsequence/
 ☐ ☐ ☐ ☐ ☐ Edit Distance - https://leetcode.com/problems/edit-distance/
 ☐ ☐ ☐ ☐ ☐ Longest Palindromic Subsequence -
https://leetcode.com/problems/longest-palindromic-subsequence/
 ☐ ☐ ☐ ☐ ☐ Interleaving String - https://leetcode.com/problems/interleaving-
string/

3. Knapsack Pattern
 ☐ ☐ ☐ ☐ ☐ 0/1 Knapsack - https://practice.geeksforgeeks.org/problems/0-1-
knapsack-problem0945/1
 ☐ ☐ ☐ ☐ ☐ Unbounded Knapsack -
https://practice.geeksforgeeks.org/problems/knapsack-with-duplicate-items4201/1
 ☐ ☐ ☐ ☐ ☐ Coin Change (number of ways) - https://leetcode.com/problems/coin-
change-2/
 ☐ ☐ ☐ ☐ ☐ Coin Change (minimum number of coins) -
https://leetcode.com/problems/coin-change/
 ☐ ☐ ☐ ☐ ☐ Target Sum - https://leetcode.com/problems/target-sum/
 ☐ ☐ ☐ ☐ ☐ Subset Sum Equal to K - https://www.geeksforgeeks.org/subset-sum-
problem-dp-25/

4. Palindromic Subsequence/Substring Pattern


 ☐ ☐ ☐ ☐ ☐ Longest Palindromic Substring -
https://leetcode.com/problems/longest-palindromic-substring/
 ☐ ☐ ☐ ☐ ☐ Palindromic Substrings - https://leetcode.com/problems/palindromic-
substrings/
 ☐ ☐ ☐ ☐ ☐ Minimum Cuts to Partition a String into Palindromes -
https://leetcode.com/problems/palindrome-partitioning-ii/
 ☐ ☐ ☐ ☐ ☐ Minimum Insertions to Make a Palindrome -
https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-
palindrome/

5. Longest Increasing Subsequence (LIS) Pattern


 ☐ ☐ ☐ ☐ ☐ Longest Increasing Subsequence -
https://leetcode.com/problems/longest-increasing-subsequence/
 ☐ ☐ ☐ ☐ ☐ Building Bridges - https://www.geeksforgeeks.org/dynamic-
programming-building-bridges/
 ☐ ☐ ☐ ☐ ☐ Russian Doll Envelopes - https://leetcode.com/problems/russian-doll-
envelopes/

6. Matrix Chain Multiplication Pattern


 ☐ ☐ ☐ ☐ ☐ Matrix Chain Multiplication - https://www.geeksforgeeks.org/matrix-
chain-multiplication-dp-8/
 ☐ ☐ ☐ ☐ ☐ Burst Balloons - https://leetcode.com/problems/burst-balloons/

7. Partition DP
 ☐ ☐ ☐ ☐ ☐ Minimum Cost to Cut a Stick -
https://leetcode.com/problems/minimum-cost-to-cut-a-stick/
 ☐ ☐ ☐ ☐ ☐ Palindrome Partitioning II -
https://leetcode.com/problems/palindrome-partitioning-ii/
 ☐ ☐ ☐ ☐ ☐ Evaluate Boolean Expression to True -
https://www.geeksforgeeks.org/boolean-parenthesization-problem-dp-37/

8. Problems on Trees
 ☐ ☐ ☐ ☐ ☐ Maximum Path Sum in Binary Tree -
https://leetcode.com/problems/binary-tree-maximum-path-sum/
 ☐ ☐ ☐ ☐ ☐ House Robber III - https://leetcode.com/problems/house-robber-iii/
 ☐ ☐ ☐ ☐ ☐ Diameter of Binary Tree - https://leetcode.com/problems/diameter-
of-binary-tree/
 ☐ ☐ ☐ ☐ ☐ Lowest Common Ancestor (with DP optimization) -
https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/

9. Digit DP
 ☐ ☐ ☐ ☐ ☐ Numbers At Most N Given Digit Set -
https://leetcode.com/problems/numbers-at-most-n-given-digit-set/
 ☐ ☐ ☐ ☐ ☐ Count Numbers with Unique Digits -
https://leetcode.com/problems/count-numbers-with-unique-digits/
 ☐ ☐ ☐ ☐ ☐ Prime Number of Set Bits - https://leetcode.com/problems/prime-
number-of-set-bits-in-binary-representation/

10. Bitmasking DP
 ☐ ☐ ☐ ☐ ☐ Traveling Salesperson Problem (TSP) -
https://www.geeksforgeeks.org/solve-dynamic-programming-problem-tsp/
 ☐ ☐ ☐ ☐ ☐ Minimum Cost to Visit Every Node in a Graph -
https://leetcode.com/problems/minimum-cost-to-visit-every-node/
 ☐ ☐ ☐ ☐ ☐ Maximum XOR Subset - https://www.geeksforgeeks.org/find-
maximum-xor-subset-given-set/

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy