# Maximum Product Of The Length Of Two Palindromic Substrings: Walkthrough
Maximum Product Of The Length Of Two Palindromic Substrings shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Find two non-overlapping palindromic substrings maximizing length product. Manacher gives every odd/even palindrome radius; sweep left-max and right-max palindrome lengths that end on each side of a cut.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Using subsequences instead of contiguous substrings, or allowing the two palindromes to overlap.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at the Linkjob AI app.