Given a string s, partition s such that every substring in the partition is a palindrome.

Return the minimum number of cuts needed for a palindrome partitioning of s.

Constraints:

• $1 \leq$ s.length $\leq 2000$

• s consists of lowercase English letters only.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.