I've edited the description to make this clear just in case.

1321 doesn't contain 121. Nowhere in the description does it say to permutate the input.

I don't understand, 1321 also contains palindrome(121) and the test should return False.

In my solution,I have to get all substring until find the palindrome.
So...
It is inefficient.
And that's why I felt amazing.
Your solutions are better~

Thank you!

Crystal translation submitted

because it contains a palindrome : 121 ! ;)

This may be a stupid question - how is 1215 a palindrome? I do not understand this. Is it because 1215 = 5121 is a palindrome?

hello, I enjoyed chipping away at your kata.

I kinda took a brute force approach. I would be grateful for any tips on what a solid next step would be.

JS can only handle number less than 10 ^ 16 before switching to exponentiation form.
You have two options:

• find a way to not generate such huge numbers: you're only interested by the zeroes at the end of this number afterwards.
• switch to a language that handle infinite digits arithmetic (yes this kata is terribly easy in Python)

When I discovered this kata, I just read the title, then I began to work on an algorithm based on my assumption.
After quite a struggle, I opened the editor and saw the full description: well wrong algorithm, but it was easy to adapt it.
Thanks for the challenge anyway! :')