$ ./guess_the_languageProblem Solving — fill the blank
Problem Solving — fill the blank · hard · #126

Complete the recursion

// returns the nth Fibonacci number (fib(0)=0, fib(1)=1)
function fib(n: number): number {
  if (n < 2) return ____;
  return fib(n - 1) + fib(n - 2);
}

Answer: n (also accepted: n, n())

For n < 2 the value equals n itself (0 or 1).
Play Problem Solving ▸