n-bonacci algorithm | SoloLearn

nBonacci.js

const nFibonacci = (n, max) => {
  const result = Array(n)
    .fill(0)
    .fill(1, n - 1 || 1)
  for (let i = result.length; i < max; i++) {
    const nSums = result
      .slice(result.length - n)
      .reduce((acc, val) => BigInt(acc) + BigInt(val), 0)
    result.push(nSums)
  }
  return n < max ? result : result.slice(0, max)
}

console.log(nFibonacci(2, 10)) // [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
// N-bonacci visualizer
// https://code.sololearn.com/WGzh210dVDgZ/#