You are given a 2D integer array, intervals, where each element intervals[i] = $[left_i, \space right_i]$ represents the $i^{th}$ interval on the number line. Each interval includes all integers from $left_i$ to $right_i$, inclusive. The size (length) of an interval $[left_i, \space right_i]$ is defined as $\text{size} = right_i - left_i + 1$.

You are also given an integer array, queries. For each query value queries[j], you must find the smallest-sized interval $[left_i, \space right_i]$ such that $left_i \le queries[j] \le right_i$.

• If at least one interval contains the query, return the minimum interval size among those intervals.

• If no interval contains the query, return -1 for that query.

Return an array, answer, where answer[j] is the result for queries[j].

Constraints:

• $1 \leq$ intervals.length $\leq 10^5$

• $1 \leq$ queries.length $\leq 10^5$

• intervals[i].length $== 2$

• $1 \leq left_i$ $\leq right_i$ $\leq 10^7$

• $1 \leq$ queries[j] $\leq 10^7$

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.