Hard · Dynamic Programming · about 30 minutes
Asked at Amazon, Google, Microsoft.
Given a string s, partition it so that every part is a palindrome. Return the minimum number of cuts needed.
s