Leetcode, Interval, Interview Questions, Google, Meta.
interval. Time complexity is O(N*logN). Problem 3: Given a list of intervals A and one interval B, find the least number of intervals from A that can fully cover B. If cannot find any result, just return 0. Example 1: Input: A = [[0, 3], [3, 4], [4, 6], [2, 7]] B = [0,6] Output: 2 Explanation: We