Palindromic Subsequence

CodeChefOpen on judge ↗

Mayur was given a punishment to count all the subsets of a word which are palindrome. As it will take a lot of time to write and count all such subsets individually, he wants to use his programming skills to complete the punishment. Write a program for the same. (Note: Upper case letters and lower-case letters are different) ###Input: - The single line contains string input. ###Output:

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