How Do You Find the Nth Fibonacci Number in Java

import java. util. HashMap; … class Main.{ // Function to find the nth Fibonacci number.public static int fib(int n, Map<Integer, Integer> lookup) {if (n <= 1) { return n;}// if the subproblem is seen for the first time. lookup. putIfAbsent(n, fib(n – 1, lookup) + fib(n – 2, lookup));return lookup. get(n);

How do you find the nth number in a Fibonacci sequence in Java?

1. import java. util. HashMap; …
2. class Main.
3. { // Function to find the nth Fibonacci number.
4. public static int fib(int n, Map<Integer, Integer> lookup) {
5. if (n <= 1) { return n;
6. }
7. // if the subproblem is seen for the first time. lookup. putIfAbsent(n, fib(n – 1, lookup) + fib(n – 2, lookup));
8. return lookup. get(n);

Which technique is used to get the nth Fibonacci term?

Explanation: We find the nth fibonacci term by finding previous fibonacci terms, i.e. by solving subproblems. Hence, line 7 shows the optimal substructure property. Which technique is used by line 7 of the above code?