LPS - Longest Palindromic Substring

no tags 

A palindrome is a string that is the same as its reverse. Example "malayalam", "dad", "appa" etc. In this problem you are asked to find the length of the longest contiguous substring of a given string, which is a palindrome.



The first line consists of a single integer N, the no. of characters in the string. 1 <= N <= 100000.

Second line is a string with N characters, where the characters are always lowercase english alphabets, ie 'a' to 'z'. 



A single line with an integer representing the length of longest palindromic substring.







hide comments
yogi9046: 2016-01-11 06:57:23

did anyone get it correct? any corner test cases

Pawankumar P: 2015-11-30 05:58:40

cin -> TLE.
scanf -> AC.
(Even with Manacher)

Last edit: 2015-11-30 05:58:53
Mayank Raj: 2015-10-26 15:05:24

It would be nice if spoj is more python friendly - python is the future my dear!

gaurav117: 2015-09-29 04:38:36

is there some sort of error in the test cases since my same code (with some input output modifications) got ac in MSUBSTR ??

B@dsh@h: 2015-09-20 20:19:45

is string with space to be considered or not?

B@dsh@h: 2015-09-20 20:19:02

my solution is far correct but it gives me wrong ans...

José Carlos Gutiérrez: 2015-07-11 19:20:45

fix the statement, in input there are characters that are not lower case english letters...

Mohit Pandey: 2015-06-23 14:29:55

Wrong test cases!
AC sol gives ans 4!

Siddharth Singh: 2015-06-01 17:18:44

O(N^2) Solution not Passing with C :(

canhnht: 2015-04-29 10:48:43

tests like lol

Added by:Srivatsan B
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET