Does this need to be solved with one method?

Question about the task

Resolved

Do I need to solve this task within this method?

public int fibonacci(int n) {

   return 0;

}

Or will I need to make a helper method that uses arrays to keep track of the n-1, n-2?

Comments (3)

You must be signed in to leave a comment

Level 37

21 February 2021, 16:09

solution

To those who need a hint: You can solve it within the method only, you will need to use recursion TWICE one the same line.

Level 36 , Germany

21 February 2021, 15:29

yes, I've tried with two methods at first, too. But that won't validate.

Level 37

21 February 2021, 15:37

It's a hard task for sure! I don't wannt cheat and look at the solution, but I'm also not sur if we can modify the method at all?