Available question text
Given a set of video clips as intervals, find the minimum number of clips (you may cut clips) whose segments can cover the entire target interval [0, time], or return -1 if impossible. This is an interval covering problem — typically solved greedily by repeatedly picking the clip that starts at or before the current coverage and extends farthest.
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 1024. Video Stitching
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source