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.^^
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 :)
Test if a Number is a Palindrome without using any String Operations
145 Solvers
Matrix indexing with two vectors of indices
377 Solvers
178 Solvers
348 Solvers
439 Solvers