Databricks OA 2023

Given an infinite number line and an array of unique integers representing the positions of houses that should be built there in the order they appear in the array. At each ith moment you have to tell the largest contiguous subarray of houses on the number line.  N <= 1e5 -1e9 <=A[i] <= 1e9