Hard Problemspalindromepartitioninterval
Palindrome Partitioning
Given a string, split it into the fewest possible pieces such that every piece, read on its own, is a palindrome.
Do this lesson first: coin changeThe full breakdown and animated table for this problem are still being written. In the meantime, run the four questions on it yourself — that is the whole exercise.