It's not optimal, you are right! But actually, it only needs to iterate through the list 4 times. The len() method in python does not need to iterate through the array to find the length, but python caches the length in an attribute!

Very clever, smart thinking. Didnt even realise they would all have to be equal to get back to same spot facepalm.

Less efficient than it could have been, but given the max length of the walk, probably not worth worrying about here.
In general x times the work when not needed is not what you should aspire to.

this iterates through the list a total of 5 times so while it looks pythonic, it's not optimal. But a very readable solution nonetheless :).

I think that solution so clever.

this is very clever.. this makes it sounds like the exercise is easy bwhen i built something so complicated to achieve the same result!!

I really admire the way you approach problem

Oh my God! It's brilliant!

Mine is the same. But I used tuple instead of list.

because that's a code working only for python 2

This code doesn't seem to pass when I copy and paste it.
range(1, 6) should equal [1, 2, 3, 4, 5]

?

too many list countings. Not for production as i think

Lol. It looks like you're trying to program in C.

Stop flexing lol, mine was like 20 lines

Yeah, that does make sense. I try to solve these in the least amount of effort though. I can't be bothered to import a module.