Maximum Width Ramp - Practice Coding Problems

Maximum Width Ramp - Problem

A ramp in an integer array nums is a pair (i, j) for which i < j and nums[i] <= nums[j].

The width of such a ramp is j - i.

Given an integer array nums, return the maximum width of a ramp in nums.

If there is no ramp in nums, return 0.

Input & Output

Example 1 — Basic Ramp

$ Input: nums = [6,0,8,2,1,5]

› Output: 4

💡 Note: The maximum width ramp is from index 1 to index 5: nums[1] = 0 <= nums[5] = 5, width = 5 - 1 = 4

Example 2 — Decreasing Array

$ Input: nums = [9,8,1,0,1,9,4,0,4,1]

› Output: 7

💡 Note: The maximum width ramp is from index 2 to index 9: nums[2] = 1 <= nums[9] = 1, width = 9 - 2 = 7

Example 3 — No Valid Ramp

$ Input: nums = [10,9,8,7,6]

› Output: 0

💡 Note: Array is strictly decreasing, so no valid ramp exists where nums[i] <= nums[j] with i < j

Constraints

2 ≤ nums.length ≤ 5 × 10⁴
0 ≤ nums[i] ≤ 5 × 10⁴

Visualization

Tap to expand

Understanding the Visualization

Input Array

Given array [6,0,8,2,1,5] with indices 0-5

Find Ramps

Identify all valid pairs (i,j) where i < j and nums[i] <= nums[j]

Maximum Width

Return the largest width j - i among all valid ramps

Key Takeaway

🎯 Key Insight: Use a monotonic decreasing stack to efficiently track potential ramp starting positions

Asked in

G Google 15 f Facebook 12 a Amazon 8

The key insight is to use a monotonic decreasing stack to efficiently identify potential starting positions for ramps. The optimal approach uses a monotonic stack to achieve O(n) time complexity. Time: O(n), Space: O(n)

Common Approaches

Approach	Time	Space	Notes
✓ Brute Force - Check All Pairs	O(n²)	O(1)	Check every possible pair (i, j) to find the maximum width ramp
Monotonic Decreasing Stack	O(n)	O(n)	Use a stack to maintain potential starting indices, then find maximum width

Brute Force - Check All Pairs — Algorithm Steps

Iterate through each index i from 0 to n-2
For each i, check all indices j from i+1 to n-1
If nums[i] <= nums[j], update maxWidth with max(maxWidth, j-i)

Visualization

Tap to expand

Step-by-Step Walkthrough

Check Pairs

Compare every i < j where nums[i] <= nums[j]

Track Width

Calculate j - i for valid pairs

Find Maximum

Keep track of the maximum width found

Code -

solution.c — C

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int solution(int* nums, int n) {
    int maxWidth = 0;
    
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (nums[i] <= nums[j]) {
                int width = j - i;
                if (width > maxWidth) {
                    maxWidth = width;
                }
            }
        }
    }
    
    return maxWidth;
}

int main() {
    char line[1000];
    fgets(line, sizeof(line), stdin);
    line[strcspn(line, "\n")] = 0;
    
    int nums[1000];
    int n = 0;
    char* token = strtok(line + 1, ",]");
    
    while (token != NULL) {
        nums[n++] = atoi(token);
        token = strtok(NULL, ",]");
    }
    
    int result = solution(nums, n);
    printf("%d\n", result);
    
    return 0;
}

Time & Space Complexity

Time Complexity

⏱️

O(n²)

Nested loops check all pairs of indices

⚠ Quadratic Growth

Space Complexity

O(1)

Only using constant extra variables

✓ Linear Space

78.5K Views

Medium Frequency

~25 min Avg. Time

2.2K Likes

Ln 1, Col 1

Smart Actions

💡 Explanation

AI Ready

💡 Suggestion Tab to accept Esc to dismiss

// Output will appear here after running code

Code Editor Closed

Click the red button to reopen

Input & Output

Constraints

Visualization

Related Problems

Common Approaches

Brute Force - Check All Pairs — Algorithm Steps

Visualization

Code -

Time & Space Complexity

Select Compiler