Longest Subarray Under Variance | Dataford Interview Questions

Given an array of integers representing signal readings, write an algorithm to find the longest contiguous subarray where the variance remains below a specific threshold. Use population variance and treat a subarray as valid when its variance is at most threshold. Implement def longest_low_variance(readings, threshold):, returning [start, end] for the earliest longest valid subarray, using zero-based inclusive indices.

Constraints

1 <= readings.length <= 2000
-10^6 <= readings[i] <= 10^6
0 <= threshold <= 10^12
Variance is population variance
Return the earliest window when multiple longest windows exist

Function Signature

def longest_low_variance(readings, threshold):

Your question is Longest Subarray Under Variance. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Constraints

1 <= readings.length <= 2000
-10^6 <= readings[i] <= 10^6
0 <= threshold <= 10^12
Variance is population variance
Return the earliest window when multiple longest windows exist

Function Signature

def longest_low_variance(readings, threshold):

Your question is Longest Subarray Under Variance. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.