Maximum Product of the Length of Two Palindromic Substrings solution leetcode
- User Accepted:0
- User Tried:0
- Total Accepted:0
- Total Submissions:0
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.
More formally, you want to choose four integers
l such that
0 <= i <= j < k <= l < s.length and both the substrings
s[k...l] are palindromes and have odd lengths.
s[i...j] denotes a substring from index
i to index
Return the maximum possible product of the lengths of the two non-intersecting palindromic substrings.
A palindrome is a string that is the same forward and backward. A substring is a contiguous sequence of characters in a string.
Input: s = "ababbb" Output: 9 Explanation: Substrings "aba" and "bbb" are palindromes with odd length. product = 3 * 3 = 9.
Input: s = "zaaaxbbby" Output: 9 Explanation: Substrings "aaa" and "bbb" are palindromes with odd length. product = 3 * 3 = 9.
2 <= s.length <= 105
sconsists of lowercase English letters.