Given a string s, determine whether it can be partitioned into $3$ non empty palindromic substrings. Return true if such a partition is possible, or false otherwise.

A string is considered palindromic if it reads the same forwards and backwards.

Constraints:

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

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