Available question text
Given a sorted array of positive integers and a target n, find the minimum number of numbers to add so every value in [1, n] can be formed as a subset sum; the core challenge is a greedy/doubling strategy that tracks the smallest unreachable value and patches to extend the reachable range until it covers [1, n].
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 330. Patching Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source