I’m working on a Java program that calculates the nth Fibonacci number. The method I initially used works fine for small values of n, but it becomes very slow as n increases, especially for values greater than 40.

I’m looking for a way to optimize the Fibonacci calculation to handle large values of n efficiently. I would appreciate it if someone could provide guidance on:

Implementing a dynamic programming approach in Java.
Any other efficient algorithms for calculating Fibonacci numbers.