LeetCode: Fibonacci Number Solution
Implementation
1var fib = function (n, mem = {}) {2 if (mem[n] != null) return mem[n]3 if (n < 2) return n4 return (mem[n] = fib(n - 1, mem) + fib(n - 2, mem))5}
References
Comments
Loading comments...
Tags
leetcode
array
recursion
Apply and earn a $2,500 bonus once you're hired on your first job!
Clients from the Fortune 500 to Silicon Valley startups
Choose your own rate, get paid on time
From hourly, part-time, to full-time positions
Flexible remote working environment
A lot of open JavaScript jobs!!
Fact corner: Referred talent are 5x more likely to pass the Toptal screening process than the average applicant.
Still hesitate? Read HoningJS author's guide on dealing with Toptal interview process.