Citadel Quantitative Analyst Interview: Fibonacci Algorithm Question
The Citadel Quantitative Analyst interview process is renowned for its rigor, often probing candidates with challenging algorithmic and computational complexity questions. One classic example is the recursive calculation of Fibonacci numbers and a detailed analysis of its time complexity.
The Fibonacci sequence is a famous series in mathematics, where each number is the sum of the two preceding ones. It appears frequently in quantitative finance, algorithmic trading, and technical interviews due to its simple definition but deep algorithmic implications.
Formally, the Fibonacci sequence is defined as:
