Search
⌘K

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.

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
Questions
Meta SWE Interview QuestionsAmazon SWE Interview QuestionsGoogle SWE Interview QuestionsOpenAI SWE Interview QuestionsAnthropic SWE Interview QuestionsEngineering Manager (EM) Interview Questions
Learn
Learn System DesignLearn DSALearn BehavioralLearn ML System DesignLearn Low Level DesignGuided Practice
Links
FAQPricingGift PremiumHello Interview Premium
Legal
Terms and ConditionsPrivacy PolicySecurity
Contact
About UsProduct Support

7511 Greenwood Ave North Unit #4238 Seattle WA 98103

© 2026 Optick Labs Inc. All rights reserved.

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