CodingHardcod-g569

Subject Sliding windowLevel Senior–Staff~30 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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) → int

Examples

in[[8,2,4,7],4]out2

What 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.