I want to solve this but the hardest part of the problem should be coding it, not figuring out how to read your Oooook language. Already wasted an hour trying to decode it and hitting a wall, despite wanting to write a nice parser for it.

No random tests...

I feel like my solution is super long but it works so ¯\(ツ)/¯

I could not solve this a few months ago...did it today : ) good kata thanks

Fun Kata, not too hard but maybe 5kyu

this is not 5 kyu..its barely 7yu.

(JS) Needs random tests, but still a fun kata. Thanks

Fun ! Rated 6kyu

Like the others, poor description.

Why couldn't you just say " add 'k' to the end of the string n times if the string is not already a perfect squared length " ? Simple can be a good thing

What does this mean ""Complete t with the char of ascii code 11 (we suppose that this char is not in our original text) until the length of t is n * n."? " I understand everything else the problem wants but this sentence is just meaningless to me.

JS needs random tests...please ! Good Kata though

Very satisfying to solve, great Kata

Fun Kata :)