Can Haskell be a practical language choice for passing a FAANG-style coding interview? To find this out we’re going to solve a typical interview problem in Haskell in 2 different ways:
- simple with recursion and persistent maps, and
- more advanced with mutable arrays and ST monad.
In both cases we’re going to look at how straightforward the translation from the original idea to the code is.
- Coding problem: link to Hackerrank.
- Source code of the solutions: link to Github.