CodingMediumcod-g071

Subject ArraysLevel Mid–Senior~25 minCommon in Databases & SQL · Algorithms & data structures interviewsIndustries Software development

Question

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

Examples

in[[6,0,8,2,1,5],0]out4

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.