It's cool to see people still are playing with this;
I haven't looked at CodeWars in a while, sorry about that, but looks like you got it aproved

I see, your solution is bypassing the point, so I added a 30x30 character restriction

I really appreciate your comment!

I have corrected all the spelling errors I could find, I believe I caught all the ones you mentioned.As for 8, I think just removing that bit makes it less unclear (why am I using a double negative? IDK...) and 10, I did as you suggested and reformatted the bottom a little to compensate.

lol, I just replaced 3 with 2 in my code, I didn't check it. I'm just going to trash this Kata.

I got

n*2+1 for 1: 1
n*2+1 for 2: 2
n*2+1 for 3: 107
n*2+1 for 4: 3
n*2+1 for 5: 210
n*2+1 for 6: 108
n*2+1 for 7: 106
n*2+1 for 8: 4
n*2+1 for 9: 311
n*2+1 for 10: 211

returning the path has been done, and 2*n+1 is basically the same thing...

Sorry, I didn't check.

You're using two for loops that go all the way to n.
You simply have to either get rid of one of the for loops or at least minimize which tests you look at.

I had the same issue and I chose to get rid of one of the for loops, although that meant I had to deal with floating point errors.