Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitionings of s.

Note: A palindrome is a string that reads the same backward as forward.

Constraints:

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

• s contains only lowercase English letters.

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.