Explain Your Thinking

Walk through your approach like an interview

MediumGreedy Algorithms

Video Stitching

Given clips [start, end] and target duration T, find minimum clips to cover [0, T]. Return -1 if impossible.

Example

Input: clips = [[0,2], [4,6], [8,10], [1,9], [1,5], [5,9]], T = 10

Output: 3

Use [0,2], [1,9], [8,10] to cover [0,10].

Phase 1 of 4Pattern

Binary searching for the right lesson...