Given a string s, determine the minimum number of insertions needed to make s a palindrome.

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

Constraints:

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

• s consists of 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.