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 any two elements within it is less than or equal to limit. The array has 1 to 10^5 elements with values in 32-bit signed range, and limit is a non-negative integer.
Implement
longest_subarray_within_limit(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 35 min
solution.py
InputExpectedGot
[[8,2,4,7],4]2not run yetsample