Frage im Vorstellungsgespräch bei UBS
Few algorithms for computing efficiently the Fibonacci sequence
Antwort im Vorstellungsgespräch
Anonym
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).