/*Given a string S, find the number of different non-empty palindromic subsequences in S, and return that number modulo 10^9 + 7. A subsequence of a string S is obtained by deleting 0 or more ...
Given a string s, return the number of different non-empty palindromic subsequences in s. Since the answer may be very large, return it modulo 10⁹ + 7. A subsequence of a string is obtained by ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback