That was one hell of a Kata, had it open for about 2 weeks and finally finished it today. Was just a case of wrangling with a certain algorithm which shall not be named to get it to work efficiently. Also using numpy arrays instead of lists.

You have to use the results of the encoder to reverse engineer it and write a corresponding decoder. The example inputs are to give you some helpful insights into how the encoder actually works.

poo

Hardest Kata ever (in BF)

Love a good cypher

As with others I took a bit of time to get q1 and q3 right, but I'm just bad at reading long descriptions and went with the wikipedia definition instead of the hint outlined in the kata. Overall this was a nice kata and I enjoyed it.

I don't think I solved this in the intended way

Only took me a few minutes but the solution felt very satisfying.

Hey that was great. Took a while to understand what was being asked though, I'm not very good at reading long descriptions.

I've found bitwise operators really useful in the past for storing booleans and it was fun working out how to do this one.

Glad I did all those regex katas so I can unnecessarily use regex for things like this.

Pretty good once I actually understood it.

These katas are helping me discover SQL features I never could have dreamed of.