125. Valid Palindrome A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward.

# Given 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. # For example, given s = "aab", # ...