You are given a $2$D integer array ranges and two integers left and right. Each ranges[i] = [start_i, end_i] represents an inclusive interval between start_i and end_i.

Return true if every integer in the inclusive range $[$left, right$]$ is covered by at least one interval in ranges. Otherwise, return false.

An integer $x$ is considered covered by an interval ranges[i] = [start_i, end_i] if start_i $\leq x \leq$ end_i.

Constraints:

• $1 \leq$ ranges.length $\leq 50$

• $1 \leq$ start_i $\leq$ end_i $\leq 50$

• $1 \leq$ left $\leq$ right $\leq 50$

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.