Leetcode 2002. Maximum Product of the Length of Two Palindromic Subsequences

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.