How to approach?

#1

Given a string S find the largest product possible of length of two non-overlapping palindrome substrings of odd length of S.

Constraints:
1 <= |S| <= 10000

Examples:
ababbb => 9 (aba and bbb)
Please tell me the approach to this problem .

#2


Please refer to this link.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.