- This is among the top algorithm forcompetitive_programming , other algorithm are available here, https://www.geeksforgeeks.org/top-algorithms-and-data-structures-for-competitive-programming/
- Q. What is the minimum time complexity to find n’th Fibonacci Number?
- Ans. We can find n’th Fibonacci Number in O(Log n) time using Matrix Exponentiation.