🧩Pro

Mastering Dynamic Programming Patterns

Master dynamic programming by learning the underlying patterns. Covers 0/1 Knapsack, Unbounded Knapsack, Fibonacci, Palindromic Subsequences, LCS, Matrix Chain Multiplication, and DP on Strings — with hands-on Python exercises.

7 modules 42 lessons ~11h AI voice coach

Start Learning — Pro

7-day free Pro trial included

Course Outline

0/1 Knapsack Pattern

6 lessons

Learn the 0/1 Knapsack pattern and apply it to subset selection problems where each item can be included or excluded.

Introduction to 0/1 Knapsack

0/1 Knapsack

Equal Subset Sum Partition

Subset Sum

Minimum Subset Sum Difference

Count of Subset Sum

Unbounded Knapsack Pattern

6 lessons

Learn the Unbounded Knapsack pattern where each item can be selected an unlimited number of times.

Introduction to Unbounded Knapsack

Unbounded Knapsack

Rod Cutting

Coin Change (Count Ways)

Minimum Coin Change

Maximum Ribbon Cut

Fibonacci Numbers Pattern

6 lessons

Recognize and solve problems where each state depends on the previous one or two states — the Fibonacci pattern family.

Introduction to the Fibonacci Pattern

Fibonacci Numbers

Staircase (Climbing Stairs)

Number Factors

Minimum Jumps to Reach End

House Thief (House Robber)

Palindromic Subsequence Pattern

6 lessons

Master problems involving palindromic subsequences and substrings using interval DP techniques.

Introduction to Palindromic Subsequences

Longest Palindromic Subsequence

Longest Palindromic Substring

Count of Palindromic Substrings

Minimum Deletions for Palindrome

Palindromic Partitioning

Longest Common Substring Pattern

7 lessons

Master the LCS family of problems: longest common substring, subsequence, edit operations, and increasing subsequences.

Introduction to the LCS Pattern

Longest Common Substring

Longest Common Subsequence

Minimum Deletions & Insertions to Transform

Longest Increasing Subsequence

Maximum Sum Increasing Subsequence

Shortest Common Supersequence

Matrix Chain Multiplication Pattern

5 lessons

Learn the interval DP pattern through matrix chain multiplication and related partition problems.

Introduction to the MCM Pattern

Matrix Chain Multiplication

Burst Balloons

Minimum Cost to Merge Stones

Boolean Parenthesization

DP on Strings & Sequences

6 lessons

Solve advanced DP problems on strings including edit distance, interleaving, and pattern matching.

Introduction to DP on Strings

Edit Distance

String Interleaving

Longest Alternating Subsequence

Egg Dropping Problem

Regular Expression Matching