You are given an array of video clips clips where clips[i] = [start_i, end_i] indicates a clip that begins at start_i and concludes at end_i. You are also given an integer time.

Any clip can be cut into smaller segments. A collection of overlapping or touching clips can be joined together to span a continuous duration.

Determine the minimum number of clips required to fully cover the interval from $0$ to time. If the entire interval cannot be covered, return $-1$.

Constraints:

• $1 \le$ clips.length $\le 100$

• $0 \le$ start_i $\le$ end_i $\le 100$

• $1 \le$ time $\le 100$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.