Skip to main content
Admissions guidance, study banks, and career tools — get started on Shalyam

Count Different Palindromic Subsequences

Print the number of distinct non-empty palindromic subsequences of a string, modulo 1,000,000,007.

Constraints

1 <= len(s) <= 1000

Discussion

No discussions yet.

Rewards · v2.1

Get Exclusive Insights with Every Issue

Join Shalyam Newsletter

Stay ahead in education, research, and innovation—straight to your inbox.