Given the string a, find the longest palindromic sub-string b.
So when
a = 'xkayakyy';
you should return
b = 'kayak';
Solution Stats
Problem Comments
-
2 Comments
David Young
on 8 Feb 2012
This needs a richer test suite, as the leading solution at the time of this comment is just a lookup table.
Hans Kramer
on 31 Oct 2018
You should add testcases where the palindrome is in the 2nd half of the word. Cause then my solution wouldnt work and i had to come up with something else.^^
Solution Comments
-
1 Comment
Freddy
on 24 Mar 2012
Better than lookup, worse than finding maximum palindrom.
-
2 Comments
David Young
on 8 Feb 2012
This ought to be the leading solution.
Trung Duong
on 9 Feb 2012
mine is dump but good for my eyes + brain, :)
-
2 Comments
Sven
on 19 Feb 2012
What's the point in even making these non-solutions?
AMITAVA BISWAS
on 2 Apr 2012
If no solution then non-solution is solution :)
Recent Solvers414
Suggested Problems
-
197 Solvers
-
230 Solvers
-
351 Solvers
-
Back to basics 16 - byte order
144 Solvers
-
295 Solvers
More from this Author95
Tags
Discover what MATLAB® can do for your career.
Opportunities for recent engineering grads.
Apply Today