Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1414. Find the Minimum Number of Fibonacci Numbers Whose Sum Is K
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source