Markdium-14 Fibonacci Interview Questions (SOLVED) To Brush Before Coding Interview

Markdium-JavaScript.js

// Iterative Solution for Fibonacci Numbers
function *fibonacci(n) {
  const infinite = !n && n !== 0;
  let current = 0;
  let next = 1;

  while (infinite || n--) {
    yield current;
    [current, next] = [next, current + next];
  }
}

// Recursive Solution for Fibonacci Numbers
function *fibonacci(n = null, current = 0, next = 1) {
  if (n === 0) {
    return current;
  }

  let m = n !== null ? n - 1 : null;

  yield current;
  yield *fibonacci(m, next, current + next);
}