Trapping Rain Water | Top Interview Questions | Ultimate Leetcode Challenge | #42
Trapping Rain Water
Subscribe to my channel --- / @codersbyyutish3249
Link to Ultimate Leetcode Challenge Playlist --- • Ultimate Leetcode Challenge
Also checkout my playlist on Coding Interview Problems --- • Coding Interview Problems for Beginners
-------------------------------------------------------------------------------------------------------------------
Problem Statement - 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.
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
n = [1, 2 * 10^4]
height[i] = [0, 10^5]
Link to the problem --- https://leetcode.com/problems/trappin...
#CodersbyYutish #ultimateleetcodechallenge #topinterviewquestions #leetcode #softwareengineering #placementtest