Palindromic subsequences of length 5 in binary string
Filed under LinkedIn
The question
For a string consisting only of '0' and '1', find the number of subsequences of length 5 that are palindromes, modulo 1e9+7.
No write-up yet. Related questions below have one.
Related LinkedIn questions
Collected from public candidate posts and coding forums. Updated Nov 2026.