This is the second part in a 2-part series on the "Fibonacci" interview problem. We are building off of a previous post, so take a look at Part I if you haven't seen it. Previously, we examined the problem and constructed a logarithmic-time solution based on computing the power of a matrix. Now we will derive a …

Read More

Few interview problems are as notorious as the "Fibonacci" interview question. At first glance, it seems good: Most people know something about the problem, and there are several clever ways to achieve a linear time solution. Usually, in interviews, the linear time solution is the expected solution. However, the …

Read More