The question was given the definition of a Fibonacci sequence, write a function to give the n-th term of the sequence. I recognized right off the bat that there was both a recursive and non recursive solution to the problem. I wanted to code the non recursive solution because it would be inherently better than the recursive solution. However, the interviewer asked me to do the recursive one instead. I stumbled a little bit with the special cases but quickly realized my error and came up with the correct solution. My concern was that I did not slam dunk this like most people do but I still managed to come up with the correct solution. Problem is I'm not quick enough.