Available question text
Given coin values and a target, find the minimum number of extra coins to add so every integer in [1, target] can be formed as a subsequence (subset) sum. The core challenge is a greedy interval-covering: sort coins and maintain the maximum reachable prefix, adding the smallest missing value when a gap appears until the prefix reaches target.
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 2952. Minimum Number of Coins to be Added
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source