Nice one. Learned Rust closures in one run:)

Haven't been here for a couple of months. As for random test cases, it has them. See it "should work for random pyramids" $ do ....

Actually, the rules of 'sliding' are shown in description, and there the condition mentioned above is clear

Thanks. Glad you liked it)

Yes, thanks, I will.

Thanks, I appreciate it.

fix request: buildTree still produces incorrect trees, thus all tests are failing

@bkaes: Honestly, I thought it doesn't need approval:( Thanks for pointing at it. I would still think translations are there. Anyway, I've got into trouble with approving JS solution because of some merging problems, but it seems like I cannot find how to perform merging. Can you tell me how to do it?

Thank you, that is great to hear.

Sorry that it took so long, but I've finally added random tests. Thanks for your suggestions:)

JavaScript is very compact too, especially in the "Write in 30 lines of JS" examples, but I like it in Haskell, because such recursive solutions look very natural when using minimal math-like notation.

Is it even possible to stop people from doing anything?:) It is intended to stimulate self-consciousness and "can I actually dot it?" thoughts, I think.

It was initially intended to use ruby and its undef feature but I've got lazy and busy in university so it all ended up like this.

Thanks, this is a good suggestion. I will add it in few days