The intention behind the task is to solve it without hashing. However, some languages do not block this, and if you can use HashMap in your language to solve the challenge, good for you! But you will miss an opportunity to learn a nice algorithm :)

its a troll kata, clearly no point doing it

I totally agree. Same here. Got stuck 2 hours of "finding error", I've got so pissed, so decided to write all combinations on paper, and check it. Should be no mistake. Someone needs to check Kotlin random tests.

Same. :D

This is lvl 6 kyu. I dont think you need to create it from 0. Most likely you need to find a "method".

Image restored.

proba una forma recursiva. recorre el tablero y checkea si corresponde a la palabra, si lo es, revisa si alguna de las adyacentes corresponde a la siguiente letra y etc.

I don't think so. I spent a couple of hours implementing it by reading the wiki, a blog post and using the site sha256algorithm.com to understand the steps and how it works. I did it in Erlang and learned a bit of the language operators for binary data in the process, which I don't use often. It was fun.

Yeah, I've added that now to Kata description (ex3) just to make it obvious you need to handle such cases.

Your task is to check whether it is possible to pair the shoes you found in such a way that each pair consists of a right and a left shoe of an equal size.

you have two left shoes of size 30 here. You cannot pair them.

Please use the question tag to ask for help. An issue is a bug in the kata

Thanks!

Thanks! Glad you enjoyed. Good solution btw.

easy for you, hard for me; test the next episode, please

I agree!
However most users voted it as 7Kyu, so maybe it's easier in other languages?

"I think" is not proof, and not something we can replicate or confirm.

If you're gonna raise issues, please provide sufficient evidence to be taken seriously.