Overall, a fun challenge, though I agree with those who are saying the test for the empty list goes against the instructions, as it is not n x n. Yes, there is a note about it and the fix is pretty trivial, but trying to explain it away as a design choice is just silly. It's a bad design choice.

OP solved it, closing

Seems like you forgot to handle edge cases for [[]], OP solved it though, closing

OP solved it, closing

Find repeating patterns in the algorithm, normalize it into some code statements. You do not need to go through all N squares and check whether each of them have been visited upon every iteration.

OP solved it, closing

Wow, such a fun kata.

Amazing kata i am proud finishing this!

Language used : C

Could someone tell me what is that uncheated snail ? Is it an empty one ?

It seems the very last attempt (the 15th ?) crashes (signal 11 : SIGSEGV)

[EDIT]]finally got that last little devil...

Tried

def snail(array):
    return super(array)```to see if this is possible thank goodness it's not

Fun kata, not that my solution is efficient.

I have same problem. Did You solved Your problem?

    ______
   /  ___ \
  |  / ,.\ |O    O
  | |  \d/ | \__/
  |__\_____/-(..)
_/_____________/  
SNAILICIOUS KATA

very proud for finishing it

Approved