Hi Karan, I used iteration to solve the problem instead of using recursion. I think it gives better performance. It's only O(n). Thank you for your time.

A Java 21 library for easy and efficient Fibonacci number calculations. Note: This project is still under development and the library is still set as pre-release. If you decide to use this library ...