1851. Minimum Interval to Include Each Query
class Solution: def minInterval(self, intervals: list[list[int]], queries: list[int]) -> list[int]: left = intervals[:] # Sorting the intervals by the left left.sort() tq = [] for i, n in enumerate(queries): tq.append((n, i)) tq.sort(key=lambda x: x[0]) output = [-1] * len(queries) h = [] heapq.heapify(