📄️ Pattern 4: Interval DP Problems
The Range Merging Pattern: State is dpi = answer for range/substring [i...j]. Build from small intervals to large. Try all split points k between i and j.
📄️ 📏 Longest Palindromic Substring
Problem: Given a string s, return the longest palindromic substring in s.
📄️ 🔢 Palindromic Substrings (Count All)
Problem: Given a string s, return the number of palindromic substrings in it.
📄️ 🧩 Longest Palindromic Subsequence
Problem: Given a string s, find the length of the longest palindromic subsequence in it.
📄️ Burst Balloons: The Paradigm Shift
When Your Correct Intuition Can't Be Memoized: This problem teaches you that sometimes the "obvious" recursive solution, while correct, needs a complete paradigm shift to become DP-able.