HackerRank
Search results
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.
Jun 25, 2024 · Trapping Rainwater Problem states that given an array of N non-negative integers arr [] representing an elevation map where the width of each bar is 1, compute how much water it can trap after rain. Examples: Let us understand Trapping Rainwater problem with the help of some examples: Input: arr [] = {3, 0, 1, 0, 4, 0, 2} Output: 10.
Trapping Rain Water II - Given an m x n integer matrix heightMap representing the height of each unit cell in a 2D elevation map, return the volume of water it can trap after raining.
class Solution: def trap (self, height: List [int])-> int: n = len (height) l = [0] * n # l[i] := max(height[0..i]) r = [0] * n # r[i] := max(height[i..n)) for i, h in enumerate (height): l [i] = h if i == 0 else max (h, l [i-1]) for i, h in reversed (list (enumerate (height))): r [i] = h if i == n-1 else max (h, r [i + 1]) return sum (min (l ...
Mar 31, 2022 · This article will cover and explain 2 solutions to Leetcode 42, Trapping Rain Water. There are concepts that overlap with Leetcode 11 (Container With Most Water), and I recommend solving...
Dec 26, 2022 · Trapping Rain Water — LeetCode #42. 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. Explanation ...
Feb 14, 2019 · How does knowing this help us understand the water levels at both left and right? We know that the water level at either index is bound by the lower heights of the two walls (max_left,...
