GfG QA is closing soon... Please refer PRACTICE or GfG now on wards !!

Nth Fibonacci number in o (logN)

this is an amazon question :

Can you find the Nth Fibonacci number in O(log N) time complexity ???

asked Dec 18, 2015 by ApLav

1 Answer

Best answer

Please visit this link -

All methods(including O(log n)) with complete explanation are given.

answered Dec 18, 2015 by utkarsh111
selected Dec 18, 2015 by ApLav

Thank You so much. I saw the link. Very useful.