CarWale processes a sequence of signed price adjustments for a vehicle listing. Given an integer array adjustments and an integer limit, find the longest contiguous subarray whose sum is less than or equal to limit.
Values may be positive, zero, or negative, so a standard sliding window is not sufficient. Return the inclusive [start, end] indices of the longest valid subarray. If multiple subarrays have the same maximum length, return the one with the smallest start index. Return [] if no non-empty subarray is valid.
Implement longest_subarray_at_most(adjustments, limit).
adjustments, a list of integers, and limit, an integer.[start, end], or an empty list if no valid subarray exists.start through end is valid when sum(adjustments[start:end + 1]) <= limit.def longest_subarray_at_most(adjustments, limit):