Luther and Palindromes

CodeChefOpen on judge ↗

Luther has a string S of length N. He likes palindromes very much. A string is a palindrome if it reads the same backwards as forwards. For example, aba is a palindrome while abc is not. He wants to convert S into a palindrome. He want to know the minimum number of substrings that must be deleted from S so that S becomes a palindrome. Input The first line of the input contains a single integer

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