UBS interview question
Few algorithms for computing efficiently the Fibonacci sequence
Interview Answer
Anonymous
3 Apr 2024
Naive (constant space, O(n) in time), or using efficient computation of power of any real number (O(log n) in time).
Few algorithms for computing efficiently the Fibonacci sequence
Anonymous
Naive (constant space, O(n) in time), or using efficient computation of power of any real number (O(log n) in time).
Check out your Company Bowl for anonymous work chats.