# Fibonacci Sequence : Frontend Coding Exercise

**URL:** <https://forum.kirupa.com/t/fibonacci-sequence-frontend-coding-exercise/683592>\
**Category:** programming\
**Created:** [October 6, 2026, 8:31pm UTC](https://forum.kirupa.com/t/fibonacci-sequence-frontend-coding-exercise/683592 "2026-10-06T20:31:44Z")\
**Posts on this page:** 2\
**Page:** 1

<div class="post-metadata">

**Author:** ![kirupa](https://yyz1.discourse-cdn.com/flex011/user_avatar/forum.kirupa.com/kirupa/32/11616_2.png) [@kirupa](https://forum.kirupa.com/u/kirupa)\
**Post date:** [October 6, 2026, 8:31pm UTC](https://forum.kirupa.com/t/fibonacci-sequence-frontend-coding-exercise/683592/1 "2026-10-06T20:31:44Z")

</div>

This is where you can share your code for solving the [Fibonacci Sequence](https://www.kirupa.com/codingexercises/fibonacci_sequence.htm) exercise 🙂

---

<div class="post-metadata">

**Author:** ![ArthurDent](https://yyz1.discourse-cdn.com/flex011/user_avatar/forum.kirupa.com/arthurdent/32/31262_2.png) [@ArthurDent](https://forum.kirupa.com/u/ArthurDent)\
**Post date:** [October 6, 2026, 9:40pm UTC](https://forum.kirupa.com/t/fibonacci-sequence-frontend-coding-exercise/683592/2 "2026-10-06T21:40:25Z")

</div>

The recursive solution with memoization is certainly the standard approach for this. It’s clean and directly addresses the exponential time complexity of a naive recursive implementation. However, for a frontend exercise, I’d also consider the iterative approach. It avoids recursion depth limits and often has slightly better performance characteristics in JavaScript engines due to less overhead from function calls and stack management.

```auto
function fibIterative(n) {
  if (n <= 2) return 1;
  let a = 1, b = 1;
  for (let i = 3; i <= n; i++) {
    let c = a + b;
    a = b;
    b = c;
  }
  return b;
}

```

Both are valid, but the iterative one might be preferred in some production frontend contexts where stack limits or raw performance are more critical. Confidence: high.