Thank you. I have enjoyed solving this kata.

Truly enjoyable kata. It's really more in the 3kyu-2kyu range though. Definitely not a 1kyu. <3

You are correct, thank you, - I completely forgot about those. Alas, I don't get to code in OCaml as much as I'd like - I might actually attempt to translate some of my favorite katas into OCaml. :)

If anyone is struggling at understanding the description, the gist of it is that you have to come up with a way to encode a binary tree, so that any combination of balanced parentheses they throw at you, represents some binary tree and only that binary tree, i.e. one-to-one mapping.

The JavaScript translation needs a test for the edge case when all arguments are '0'.

I completely and fully agree with you - this kata is 6kyu at best. I personally feel somewhat at odds with myself now that I pretty much got free points off this kata - I was really hoping for an exciting headscratcher in OCaml.

Thank you for pointing that out. You just saved me hours of debugging in bewilderment.

@Glinator Thank you for the OCaml translation.

I have thoroughly enjoyed this kata. Thank you.

Oh, that's interesting. First thing I thought of when I saw the Stringizer was - aha, hashing!

Thank you. Approved.

ikr, lol, - tbh, it wouldn't make much sense to translate it to other higher-level languages - those tend to have a single routine for this kind of thing as part of their library.

Thank you for the report. Please review:
https://www.codewars.com/kumite/61e58f44e4b7d600453a7afe

Ah, this kata is one of the early Codewars gems. Although had the kata been created now - it would probably be a 6kyu.

Hey, thanks for the translation! Ah, Lua, takes me back to the summer of 2018!