Given an integer k, return the minimum number of Fibonacci numbers whose sum is equal to k. The same Fibonacci number may be used multiple times.

The Fibonacci numbers are defined as follows:

• $F_1 = 1$

• $F_2 = 1$

• $F_n = F_{n-1} + F_{n-2}$ for $n \ge 3$

Constraints:

• $1 \le$ k $\le 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.