Minimum Interval to Include Each Query
You are given a 2D integer array intervals, where intervals[i] = [lefti, righti] describes the ith interval starting at lefti and ending at righti (inclusive). The size of an interval is defined as the number of integers it contains, or more formally righti - lefti + 1. You are also given an integer array queries. The answer to the jth query is the size of the smallest interval i such that lefti <= queries[j] <= righti. If no such interval exists, the answer is -1.

30:00

Minimum Interval to Include Each Query
hard
Topics
Companies

You are given a 2D integer array intervals, where intervals[i] = [lefti, righti] describes the ith interval starting at lefti and ending at righti (inclusive). The size of an interval is defined as the number of integers it contains, or more formally righti - lefti + 1. You are also given an integer array queries. The answer to the jth query is the size of the smallest interval i such that lefti <= queries[j] <= righti. If no such interval exists, the answer is -1.

Example 1:
Input: {"intervals":[[1,4],[2,4],[3,6],[4,4]],"queries":[2,3,4,5]}
Output: [3,3,1,4]
Constraints:

  • 1≤intervals.length≤1051 \leq \text{intervals.length} \leq 10^5

  • 1≤queries.length≤1051 \leq \text{queries.length} \leq 10^5

  • intervals[i].length==2\text{intervals}[i].\text{length} == 2

  • 1≤lefti≤righti≤1071 \leq \text{left}_i \leq \text{right}_i \leq 10^7

  • 1≤queries[j]≤1071 \leq \text{queries}[j] \leq 10^7

Input
arr ={"intervals":[[1,4],[2,4],[3,6],[4,4]],"queries":[2,3,4,5]}

Starting with 4 intervals and 4 queries

Intervals
[1,4]
[2,4]
[3,6]
[4,4]
Queries
2
3
4
5
Results (Minimum Interval Size)
-1
-1
-1
-1
Containing Query

None

Variables
No variables to display
DepthFunction Call
Stack empty
0/5