Today's #interview question: Given an integer n, write a function to compute the nth Fibonacci number bit.ly/2Gm8qeO #codinginterview
3
2
2
0
2
@ByteByByteBlog It's shown as an example in just about every textbook on dynamic programming. But, most programmers could solve this without even having heard of dynamic programming, so does it really test knowledge of dp?
@ByteByByteBlog Fun story: I was once given this question in two separate interviews in the same week. It's super popular.
@ByteByByteBlog Why does this need more than a simple for loop in a single function?