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”,
Return 1 since the palindrome partitioning [“aa”,”b”] could be produced using 1 cut.
Credits To: leetcode.com
Hint: Time O(n), Space O(1). Moore voting
Leave me comments, if you have better ways to solve.
## Blog link: https://code.dennyzhang.com/palindrome-partitioning-ii