Whats in a Palindrome

CodeChefOpen on judge ↗

*Some Cliche story about someone needing your help to solve a problem* You are provided with a string consisting of only Latin letter $(a-z)$. You need to find the no. of subsequences which are palindromes such that all the subsequences of the palindromic subsequence are palindromes themselves. As the answer can be very large output answer with modulo $(10^9 + 7)$. ###Input: - First Line contai

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI