Longest subarray within limit
Given an integer array nums and an integer limit, return the length of the longest contiguous subarray such that the absolute difference between its maximum and minimum element is at most limit. Array length up to 1e5.
Implement
longest_subarray_abs_diff(nums: list[int], limit: int) → intExamples
in
[[8,2,4,7],4]out2What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 30 min
solution.py
InputExpectedGot
[[8,2,4,7],4]2not run yetsample