Available question text
Find two disjoint palindromic subsequences of a short string (n ≤ 12) such that the product of their lengths is maximized. Because n is small, the typical approach is to enumerate subsequences (e.g., with bitmasks), check palindromicity, and combine disjoint pairs to find the maximum product.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2002. Maximum Product of the Length of Two Palindromic Subsequences
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source