1851. Minimum Interval to Include Each Query Hard

1/**
2 * [1851] Minimum Interval to Include Each Query
3 *
4 * You are given a 2D integer array intervals, where intervals[i] = [lefti, righti] describes the i^th 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.
5 * You are also given an integer array queries. The answer to the j^th query is the size of the smallest interval i such that lefti <= queries[j] <= righti. If no such interval exists, the answer is -1.
6 * Return an array containing the answers to the queries.
7 *  
8 * Example 1:
9 * 
10 * Input: intervals = [[1,4],[2,4],[3,6],[4,4]], queries = [2,3,4,5]
11 * Output: [3,3,1,4]
12 * Explanation: The queries are processed as follows:
13 * - Query = 2: The interval [2,4] is the smallest interval containing 2. The answer is 4 - 2 + 1 = 3.
14 * - Query = 3: The interval [2,4] is the smallest interval containing 3. The answer is 4 - 2 + 1 = 3.
15 * - Query = 4: The interval [4,4] is the smallest interval containing 4. The answer is 4 - 4 + 1 = 1.
16 * - Query = 5: The interval [3,6] is the smallest interval containing 5. The answer is 6 - 3 + 1 = 4.
17 * 
18 * Example 2:
19 * 
20 * Input: intervals = [[2,3],[2,5],[1,8],[20,25]], queries = [2,19,5,22]
21 * Output: [2,-1,4,6]
22 * Explanation: The queries are processed as follows:
23 * - Query = 2: The interval [2,3] is the smallest interval containing 2. The answer is 3 - 2 + 1 = 2.
24 * - Query = 19: None of the intervals contain 19. The answer is -1.
25 * - Query = 5: The interval [2,5] is the smallest interval containing 5. The answer is 5 - 2 + 1 = 4.
26 * - Query = 22: The interval [20,25] is the smallest interval containing 22. The answer is 25 - 20 + 1 = 6.
27 * 
28 *  
29 * Constraints:
30 * 
31 * 	1 <= intervals.length <= 10^5
32 * 	1 <= queries.length <= 10^5
33 * 	intervals[i].length == 2
34 * 	1 <= lefti <= righti <= 10^7
35 * 	1 <= queries[j] <= 10^7
36 * 
37 */
38pub struct Solution {}
39
40// problem: https://leetcode.com/problems/minimum-interval-to-include-each-query/
41// discuss: https://leetcode.com/problems/minimum-interval-to-include-each-query/discuss/?currentPage=1&orderBy=most_votes&query=
42
43// submission codes start here
44
45impl Solution {
46    pub fn min_interval(intervals: Vec<Vec<i32>>, queries: Vec<i32>) -> Vec<i32> {
47        vec![]
48    }
49}
50
51// submission codes end
52
53#[cfg(test)]
54mod tests {
55    use super::*;
56
57    #[test]
58    fn test_1851() {
59    }
60}
61