1. 9

  2. 4

    Version of the original article in the wayback machine.

    It’s not the URL linked in this article, but archive.org redirects internally to the link I posted.

    1. 3

      Question 3 is fun, because the first 100 Fibonacci numbers will overflow a 64-bit integer. I wonder what the original author wanted. Are they happy for you to go to floating-point approximations? Do they want you to use a BigInt library of some kind (or a language that has it built in)?

      The author’s own answer to Question 4 was wrong, which made me laugh somewhat. The tests in the blog don’t cover any of the fun corner cases, so I’m not sure if it’s right either.

      Problem 5 is a terrible question because it’s easy to get rabbit holed on trying to solve it in a clever way, whereas a brute-force solution (8 values in tri-state logic) should be very feasible even in an interpreted language. Someone is more likely to go down the rabbit hole if they have a bit more mathematical knowledge, so this question will select for people with less maths knowledge, as well as for people with more maths knowledge and an awareness that some problems can be brute forced.