Maximum width ramp
Given an integer array a, a 'ramp' is a pair of indices (i, j) with i < j and a[i] <= a[j]. Return the maximum width j - i of any ramp. If no ramp exists, return 0. The array may contain duplicates and negative numbers; length can be 0.
Implement
max_index_distance_with_diff(a: list[int], k: int) → intExamples
in
[[6,0,8,2,1,5],0]out4What 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 25 min
solution.py
InputExpectedGot
[[6,0,8,2,1,5],0]4not run yetsample