Actually yours and his solutions are O(n^2) so you can't say his solution is a much slower one.
But I like the way you search for palindromes in your solution tho!
If it says instead got: 1, your function returned 1. The log appears above the test result, so maybe you're confusing the input of one tests with the result of another:
/
Actually yours and his solutions are O(n^2) so you can't say his solution is a much slower one.
But I like the way you search for palindromes in your solution tho!
If it says instead got: 1, your function returned 1. The log appears above the test result, so maybe you're confusing the input of one tests with the result of another:
The tests are ok.
Nota n issue of the kata (more than 14000 people passed it). Maybe a CW problem.