# Find The Minimum Number Of Fibonacci Numbers Whose Sum Is K: Walkthrough
Find The Minimum Number Of Fibonacci Numbers Whose Sum Is K shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Greedily subtract the largest Fibonacci number <= remaining k (the Zeckendorf representation is optimal here). Generate Fibs up to k, then walk them large-to-small.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(log k).
## Common mistake
Using more than the greedy count by taking many small Fibs, or generating Fibs with an int overflow.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at the Linkjob AI app.