runs in O(log n) or O(len(s))

oh thank you, I must have deleted the original comment a bit too quickly ... my bad

have you seen the comment in the initial code ?

(* uncomment if you need it: open Z;;
input of find_nb is a string representing a big integer *)

you can use the Zarith library, which is the official big integers library for OCaml. this makes the OCaml version not much harder than the other languages

The OCaml version seem way harder than other languages... why does the OCaml have to deal with big numbers as string and not other language lol

Hi, Im loving the kata (really nice detailed test set) but there is one thing not specified (or i misunderstood :D),
when i remove a branch do i have to recycle the branch id just like for atoms ?
Meaning

b.brancher(1, 1)

b.mutate(1, 1, 'H')

b.closer().unlock()

then accessing the first branch via

b.add(1, 1, "F")

should it just crash or is there the same ordering as ids
for atom being maintained ?

For now i assumed yes but all unit test works but not random ones...