Given the string a, find the longest palindromic sub-string b.
So when
a = 'xkayakyy';
you should return
b = 'kayak';
This needs a richer test suite, as the leading solution at the time of this comment is just a lookup table.
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.^^
Useful!
Better than lookup, worse than finding maximum palindrom.
This ought to be the leading solution.
mine is dump but good for my eyes + brain, :)
What's the point in even making these non-solutions?
If no solution then non-solution is solution :)
Which values occur exactly three times?
3308 Solvers
Determine Whether an array is empty
561 Solvers
474 Solvers
Relative ratio of "1" in binary number
153 Solvers
Solving Quadratic Equations (Version 1)
361 Solvers