ADOBE MTS | Heap-Based Interval Processing and Offline Query Optimization | Online Assessment Questions 2022

Q1. Minimum Interval to Include Each Query Problem Statement You are given: A list of intervals intervals where: intervals[i] = [lefti, righti] An array of query points queries. For each query q, find the size of the smallest interval that contains q. The size of an interval is: right - left + 1 If no interval contains the query point, return: -1 for that query. Return an array containing answers for all queries in their original order. Example 1 Input ...