Leetcode 1414. Find the Minimum Number of Fibonacci Numbers Whose Sum Is K

Given k (1 ≤ k ≤ 10^9), find the minimum number of Fibonacci numbers (repetition allowed) that sum to k — a coin-change style problem where the Fibonacci coin set and its Zeckendorf/greedy property guide selecting the fewest terms.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1414. Find the Minimum Number of Fibonacci Numbers Whose Sum Is K

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact