Haha you're right I'm only on 0000_0011_1110_1000 okay I'll be back when I reach 0000_0100_0000_0000 :D

1000 isn't a round number; we need 1024

Are you repeatedly popping the first element from an ordinary array? Because I believe that's O(N) time complexity because your computer has to shift all the other elements in the array to the left by one each time you do that. Not 100% sure though I've only just started reading up on DSA :D

My 1,000th kata completion! Thank you for helping me reach this milestone :D

approved

Haskell translation

it's not broken, it's a puzzle that 317 people have passed in Python. don't raise unnecessary issues please.

There's test cases where the exact same input demands different outputs. What even is this supposed to be? Specifically r5L2l4 demands [4,3] in one test case and [0,0] in another. I tried using global variables, but that didn't help. This seems like a broken problem.

approved

Haskell translation

Snake test case should be moved to the basic tests.

Mine first idea was to solve the issue with tabulation until I released that alpinist can move back. So then I selected some simple version of dijkstra which worked.

Otherwise good kata, I really enjoyed it.

This is clearly not 4kyu - 3kyu would be more appropriate

Tricky, would induce users to believe the tests cases are incorrectly built xD

Ruby translation for review

Ruby translation for review!