AQR Capital SWE Interview Question 2022 October | Heap and Sliding Window | on-campus

Question 1: Smallest Range Covering Elements from K Lists Problem Statement You have k lists of sorted integers in non-decreasing order. Find the smallest range [a, b] that includes at least one number from each of the k lists. If there are multiple answers, return the one with the smallest left value. If there is still a tie, return the one with the smallest right value. Constraints nums.length == k 1 <= k <= 3500 1 <= nums[i].length <= 50 ...