LeetCode 2002 - Maximum Product of The Length of Two Palindromic Subsequences
Parent index: LeetCode Problem Index Set 2 MOC
Problem Metadata
- LeetCode URL: https://leetcode.com/problems/maximum-product-of-the-length-of-two-palindromic-subsequences/
- Frontend ID: 2002
- Difficulty: Medium
- Primary category: Arrays & Strings
- Source lists: NeetCode Practice
Related Algorithms
Research Status
- Problem statement and constraints verified against the LeetCode page.
- Core algorithm explained in paper-style prose.
- Worked examples, edge cases, complexity proof, and pitfalls added.
- Solution variants linked back to the relevant algorithm notes.