OJ’s rants

WARNING! This post contains a spoiler for Problem #10 listed at Project Euler. Do not read the rest of this post if you’re planning to attempt to solve the problem yourself.

During my Haskell travels I have found myself using the nub function quite regularly. For those too lazy to click the link: nub removes duplicates from a list of items. eg:

Prelude> nub [1,1,3,3,5,5,6,6,6,1]
[1,3,5,6]

Fairly simple stuff. Until recently I hadn’t bothered pondering the internal implementation of this function because I hadn’t really been too worried about [...]

WARNING! This post contains a spoiler for Problem #9 listed at Project Euler. Do not read the rest of this post if you’re planning to attempt to solve the problem yourself.

WARNING! This post contains a spoiler for Problem #8 listed at Project Euler. Do not read the rest of this post if you’re planning to attempt to solve the problem yourself.

WARNING! This post contains a spoiler for Problem #7 listed at Project Euler. Do not read the rest of this post if you’re planning to attempt to solve the problem yourself.

This post was inspired by a recent interview question that was posted over at fsharp.it. It’s one of those neat little questions which looks really simple on the surface but is quite tricky.