While trawling hackerrank in order to procrastinate doing "real" work, I came across this problem in the Functional Programming section. It has you perform various incremental operations on a rose tree, such as inserting and deleting nodes and visiting adjacent nodes in the tree. In the spirit of sticking with Simple Haskell, our first attempt at the problem will use only one benign language extension and two imports.
The world is in shambles, with Italy on total lockdown and New York City surely to follow suit in the next few days. With the prospect of working from home for the foreseeable future on the horizon, what better time to hunker down and finally start that blog that I’ve been putting off writing for forever!
I’m a Haskell and Emacs enthusiast with a very small mechanical keyboard hobby. Once upon a time, I studied physics at Columbia. I’ve just finished a degree in Music Technology at NYU with Brian McFee and currently work at Lantern. In my other life, I’m a violinist and conductor, but you can find out all about that on my other website or my youtube channel.