Available question text
Given n and ranges for taps at positions 0..n (each tap i covers [i - ranges[i], i + ranges[i]]), find the minimum number of taps whose intervals together cover the entire segment [0, n], or return -1 if impossible. This is an interval-cover/jump-game style problem solvable by greedily selecting the interval with the farthest right reach at each step.
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 1326. Minimum Number of Taps to Open to Water a Garden
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source