Problem DescriptionGiven a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning of s.Example 1Input: s = "aab"O

- Expand -