Consistent Latency Analysis - Coding Interview

Problem You are given a list of service latency measurements (in ms) over time as (timestamp, latency). A period is "consistent" if every measurement within it falls within [median - d, median + d] for a given tolerance d, where median is computed over the entire period. Find the longest consistent period (contiguous subarray of measurements). Example: Constraints: n <= 10^4. Follow-ups Computing the median for every subarray is expensive. What is the brute-force complexity? Can binary search he…