I made a similar solution but yours is much more elegant as you have taken laziness into account in your Zipper data structure.
who needs lambdas anyway
We all did those
How is this lazily evaluated?
I found the solution by observation. But I would like a proper math/logic explanation. Can someone help me please?
This comment is hidden because it contains spoiler information about the solution
I hope this makes sense to me someday
I could swear that I tried that...
Not hard to do by hand, just eta conversion and infix <-> prefix notation.
Definitely not a best practice in terms of code clarity though! :D
Yeah, easy points though. The Data.Import in the solution set up also gives a valuable clue away. Too easy for a 3 kyu kata. But no complaints for now ;-}
Yes. Thanks for producing (the Haskell version at least) and updating the kata!
I have taken the generation of empty words out of the Haskell random tests.
Does this resolve your issue?
Which is a kata issue I feel unqualified to address. Author?
Even if JS is the original and leading/trailing/multiple spaces are generated, that is not ideal, because the definition of "word" becomes ambiguous -- see the issue above.
Thanks for the kata!