Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2484. Count Palindromic Subsequences
Count the number of length-5 palindromic subsequences in a digit string (they must have the form a b c b a) and return the result modulo 1e9+7. The algorithmic challenge is to efficiently count combinations of matching outer and inner digit pairs across positions (e.g., via aggregated prefix/suffix counts or DP) for strings up to ~10^4 in length.
Asked at:
Meta
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Late April, 2025
Meta
Mid-level
Late January, 2025
Meta
Mid-level
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.