You are given a 0-indexed string s and are tasked with finding two non-intersecting palindromic substrings of odd length such that the product of their lengths is maximized.

Latest commit History History 62 lines (38 loc) · 2.11 KB main Breadcrumbs leetcode-all-lan / solution / 1900-1999 / 1960.Maximum Product of the Length of Two Palindromic Substrings / ...