👏🏻 your decode() is a thing of beauty

Second sample test, I'm getting
Expected :[[0, 6, 1], [1, 1, 1], [1, 6, 2], [2, 1, 5], [2, 6, 7], [4, 2, 6], [6, 7, 3], [7, 1, 2], [7, 4, 4], [7, 7, 1], [8, 7, 3]]
Actual :[[0, 6, 1], [1, 1, 1], [1, 6, 2], [2, 6, 7], [2, 1, 5], [4, 2, 6], [6, 7, 3], [7, 1, 2], [7, 7, 1], [8, 7, 3], [9, 4, 4]]

It's not obvious to me why (8,3,4) would move to (7,4) over (9,4). It is within three moves of both (9,6,3) and (5,6,3), but travelling towards (5,6) requires moving in a less clockwise direction.

A note if you're doing this in Java, make sure to return an ArrayList to avoid the UnsupportedOperationException.
Great work on the kata!

Damn, thought I was there,
then discovered input 12311133345899.
now need to rethink my core values

this one was harder for sure

The Tao of Programming right here

Yeah, clearly I have to make it more efficient (seems I overestimated the power of generators)

The entire dictionary does print though, but not the int parameters. That's what struck me as weird

Why would that prevent the second print statement from executing though when it comes before the generator expression

26^2 different ingredients though
truly a tropical paradise

according to the instructions "the elevator should take the second call if it is closest to both calls AND if both floors are in the same direction for the elevator AND both calls are in the same direction even if it needs to change it's direction once to pick them both up." How is floor 5 closer to -7 than a lift at -4 moving downwards?

nice work 👍🏻

great Kata which teaches the programmer to formulate simpler questions rather than trying to evaluate all possibilities

not without some help from the prophets of the Old Testament

Hmm. If you can't react to the knight's moves, and the knight can see yours from the start, it can meet you wherever you go within 50 moves