Problem 1960 · Hard

Maximum Product of the Length of Two Palindromic Substrings

Pick two non-overlapping odd-length palindromic substrings to maximize the product of their lengths. The visual marks palindrome centers and sweeps best lengths from the left and right.

Open the interactive visualisation