Find the Minimum Number of Fibonacci Numbers Whose Sum Is K LeetCode solution in JavaScript

1
var findMinFibonacciNumbers = function (k) {
2
  let sequence = [1, 1],
3
    sum = sequence[0] + sequence[1];
4
  let i = 2;
5
  while (sum <= k) {
6
    sequence.push(sum);
7
    i++;
8
    sum = sequence[i - 1] + sequence[i - 2];
9
  }
10
  let j = sequence.length - 1,
11
    res = 0;
12
  while (k) {
13
    if (k >= sequence[j]) (k -= sequence[j]), res++;
14
    j--;
15
  }
16
  return res;
17
  // Time Complexity: O(n)
18
  // Space Complexity: O(n)
19
};