Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

Question

Accepted Answer

The rain water problem involves calculating the amount of rainwater that can be trapped between buildings or structures.

Calculate the maximum height of water that can be trapped at each position
Subtract the height of the building at each position to get the water level
Sum up the water levels at each position to get the total amount of trapped rainwater

Accepted Answer

def trap(height): if not height: return 0 left, right = 0, len(height) - 1 left_max, right_max = 0, 0 water = 0 while left < right: if height[left] < height[right]: if height[left] >= left_max: left_max = height[left] else: water += left_max - height[left] left += 1 else: if height[right] >= right_max: right_max = height[right] else: water += right_max - height[right] right -= 1 return water

Asked in Myntra

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

Top Software Engineer Interview Questions Asked at Myntra

Interview Questions Asked to Software Engineer at Other Companies

Top Skill-Based Questions for Myntra Software Engineer