Maximum Water Trapping | Dataford Interview Questions

Maximum Water Trapped between two buckets

Asked in the First round stage. Given an array of non-negative integers heights, where each value represents the height of a bucket wall, return the maximum water that can be trapped between any two buckets.

Implement max_water_trapped(heights) and return the maximum area formed by choosing two indices i < j, where area is min(heights[i], heights[j]) * (j - i).

Constraints

2 <= len(heights) <= 10^5
0 <= heights[i] <= 10^4

Function Signature

def max_water_trapped(heights):

Your question is Maximum Water Trapping. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Maximum Water Trapped between two buckets

Implement max_water_trapped(heights) and return the maximum area formed by choosing two indices i < j, where area is min(heights[i], heights[j]) * (j - i).

Constraints

2 <= len(heights) <= 10^5
0 <= heights[i] <= 10^4

Function Signature

def max_water_trapped(heights):

Your question is Maximum Water Trapping. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.