Pergunta de entrevista da empresa UBS
Few algorithms for computing efficiently the Fibonacci sequence
Resposta da entrevista
Sigiloso
3 de abr. de 2024
Naive (constant space, O(n) in time), or using efficient computation of power of any real number (O(log n) in time).