You are given a $0$ indexed string s. You need to choose two disjoint palindromic substrings of odd length from s such that the product of their lengths is maximized.

Return the maximum possible product of the lengths of the two substrings.

Note: A substring is a contiguous sequence of characters within a string. A string is palindromic if it reads the same forward and backward. Two substrings are disjoint if they do not share any indices.

Constraints:

• $2 \leq$ s.length $\leq 10^5$

• 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.