Leetcode 1024. Video Stitching

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.