Palindromes
Practice
4.1 (33 votes)
Approved
Basic programming
Easy
Implementation
Open
String manipulation
Problem
90% Success 18414 Attempts 20 Points 3s Time Limit 256MB Memory 1024 KB Max Code
Everybody loves palindromes, but Artur doesn't.
He has a string S that consists of lowercase English letters ('a' - 'z'). Artur 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| ≤ 100000
Explanation
"aba" is a palindrome, but "ab" isn't.
Code Editor
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor
Results
Custom Input
Run your code to see the output
Submissions
Please login to view your submissions
Similar Problems
Points:20
10 votes
Tags:
Basics of String ManipulationString AlgorithmsAlgorithms
Points:20
21 votes
Tags:
Ad-HocApprovedEasyMathOpen
Points:30
118 votes
Tags:
EasyHash MapsHashing algorithmString Manipulation
Editorial
Login to unlock the editorial
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor
Results
Custom Input
Run your code to see the output