Business
Jobs
  • About Us
  • Solutions
    • Job Postings
      Post your job and receive qualified candidates in 48h.
    • Candidate Assessments
      500+ technical and psychological tests, plus anti-fraud.
    • Headhunting
      Tailor-made executive search from start to finish.
    • Payroll + EOR
      Payroll dispersal and EOR across 15+ LATAM countries.
  • Pricing
  • Jobs

0

173
Views
Fibbonaci series using Arrow Functions

I have written a code for fibbonaci series using arrow function....But is too complex... Is there any other way to find the fibbonaci series using arrow functions only??

var n = Number(prompt("Enter limit: "));
const fibonacci = n =>
  Array.from({
    length: n
  }).reduce(
    (acc, val, i) => acc.concat(i > 1 ? acc[i - 1] + acc[i - 2] : i), []
  );
console.log("Fibonnaci series: ");
console.log(fibonacci(n));

about 4 years ago · Juan Pablo Isaza
1 answers
Answer question

0

You can use recursion to build the sequence from bottom up:

fibs = n => fibs2([0, 1], n - 2)

fibs2 = (a, n) => n === 0 ? a
    : fibs2(a.concat(a[a.length - 2] + a[a.length - 1]), n - 1)

console.log(...fibs(50))

about 4 years ago · Juan Pablo Isaza Report
Answer question
Find remote jobs

Discover the new way to find a job!

Top jobs
Top job categories
Business
Post vacancy Pricing Sales
Legal
Terms and conditions Privacy policy
© 2026 PeakU Inc. All Rights Reserved.
Andres GPT
Show me some job opportunities
There's an error!