Then you didn't understand what to do.

From what i understand, you can't start from n and go to n and n again, so here's what i did: if (walk[0]===walk[1]){return false;}

You can see other solutions in Solutions section, please, don't post solutions in Discourse. About your question, yes, there is.

If you're filling a huge array or printing too much to the console, or have some infinite loop, that's your code's problem, not a kata issue.

Please read this: https://docs.codewars.com/training/troubleshooting

I don't get it, it doesn't give an error that I failed to get a multiple, it says "Max Buffer Size Reached (1.5 MiB)".

That path won't take you back to the starting point:

... and will, of course, return you to your starting point.

Read this: https://docs.codewars.com/training/troubleshooting#print-input

When attempting, and it fails, how do i know which array was tried, so i can know what was wrong. Is it possible?

...will return true if the walk the app gives you will take you exactly ten minutes... and will, of course, return you to your starting point.

I dont understand the fourth test. It's length is 10 so it's ten minutes, there for true. I don't get it.