# Palindrome Partitioning II (LC5240)
## Problem
Interview classic: Palindrome Partitioning II.
## Approach
DP min cuts. dp[i]=min cuts for s[:i]. For each end j, expand palindrome centers.
## Complexity
Time/space depend on constraints; aim for the optimal DP/graph solution above.
## Practice tip
Walk through a small example out loud, state invariants, then code.
Practice with [Linkjob AI](https://www.linkjob.ai/).