Scribd
Upload
89 views2 pages

Dynamic Programming Master Roadmap

The document outlines a comprehensive roadmap for mastering Dynamic Programming (DP), divided into foundational concepts, 1D and 2D DP, subsequence/string DP, knapsack variants, interval DP, advanced DP problems, and optimization techniques. Each section includes key problems and topics to study, such as Fibonacci, House Robber, Unique Paths, and the Traveling Salesman Problem. This structured approach aims to guide learners through the complexities of DP in a systematic manner.

Uploaded by

SaMPaTH CM 19&[
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
89 views2 pages

Dynamic Programming Master Roadmap

The document outlines a comprehensive roadmap for mastering Dynamic Programming (DP), divided into foundational concepts, 1D and 2D DP, subsequence/string DP, knapsack variants, interval DP, advanced DP problems, and optimization techniques. Each section includes key problems and topics to study, such as Fibonacci, House Robber, Unique Paths, and the Traveling Salesman Problem. This structured approach aims to guide learners through the complexities of DP in a systematic manner.

Uploaded by

SaMPaTH CM 19&[
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

Dynamic Programming (DP) Master Roadmap

1. Foundations
Fibonacci
Climbing Stairs
Min Cost Climbing Stairs

2. 1D DP (Linear DP)
House Robber
House Robber II
Jump Game I
Jump Game II
Maximum Subarray (Kadane)
Coin Change I
Coin Change II

3. 2D DP (Grid / Matrix DP)


Unique Paths
Unique Paths II
Minimum Path Sum
Longest Common Subsequence
Edit Distance
0/1 Knapsack (GeeksForGeeks)

4. Subsequence / String DP
Longest Increasing Subsequence
Longest Common Subsequence
Longest Palindromic Subsequence
Palindrome Partitioning II
Edit Distance

5. Knapsack Variants
0/1 Knapsack
Coin Change II
Target Sum
Partition Equal Subset Sum

6. Interval DP
Matrix Chain Multiplication (GFG)
Burst Balloons
Palindrome Partitioning II
Minimum Score Triangulation
7. Advanced DP
Traveling Salesman Problem (TSP)
Maximum Independent Set in Tree (CF)
Digit DP Tutorial

8. DP Optimization Techniques
AtCoder DP Contest
Divide and Conquer Optimization Tutorial
Convex Hull Trick Tutorial

You might also like