# Maximum Product Of The Length Of Two Palindromic Subsequences: Practice Notes

Maximum Product Of The Length Of Two Palindromic Subsequences shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

n <= 12. Enumerate a bitmask of a subsequence, test whether it is palindromic, then for disjoint pairs multiply lengths. Meet-in-the-middle on bitmasks works too.

## 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(3^n) or O(2^n * n).

## Common mistake

Allowing the two subsequences to share indices.

## 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 AI help for online coding assessments.