Chef and palindromes

CodeChefOpen on judge ↗

Everybody loves palindromes, but chef doesn't. He has a string S that consists of lowercase English letters ('a' - 'z'). Chef wants to find a substring T of S of the maximal length so that T isn't a palindrome. Input The input contains a single line, containing string S. String S consists of lower case English letters. Output In a single line print the length of T Constraints - 1 ≤ |S

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