Trapping Rain Water

Difficulty: Hard | Category: Array | Asked at: Google, Amazon, Apple | Platform: Unfoldd Arena

# Trapping Rain Water 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. --- ### Examples **Example 1:** ```text Input: height = [0,1,0,2,1,0,1,3,2,1,2,1] Output: 6 Explanation: The above elevation map (black section) is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. ``` **Example 2:** ```text Input: height = [4,2,0,3,2,5] Output: 9 ``` --- ### Constraints * `n == height.length` * `1 <= n <= 2 * 10^4` * `0 <= height[i] <= 10^5`

Solve Trapping Rain Water online for free in Python, JavaScript, Java, C++, TypeScript, Go, Rust, PHP, Swift, Kotlin, Dart, Ruby, C, and C#. Practice Hard level coding interview problems with instant test case evaluation and AI-powered analysis.

Keywords: Trapping Rain Water solution, Trapping Rain Water leetcode, Trapping Rain Water python, Trapping Rain Water javascript,Trapping Rain Water java, Trapping Rain Water approach, how to solve Trapping Rain Water, hard coding problems, Array problems, coding interview preparation, DSA practice free.

Trapping Rain Water

Hard

Trapping Rain Water

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.

Examples

Example 1:

Input: height = [0,1,0,2,1,0,1,3,2,1,2,1] Output: 6 Explanation: The above elevation map (black section) is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped.

Example 2:

Input: height = [4,2,0,3,2,5] Output: 9

Constraints

  • n == height.length
  • 1 <= n <= 2 * 10^4
  • 0 <= height[i] <= 10^5
CompaniesGoogleAmazonApple
JavaScript

Login to write code

Solve problems, verify your skills, and earn XP.