Leetcode 0042. Trapping Rain Water
Posted on Sun 19 January 2025 in Leetcode • Tagged with pointers, reverse-thinking
Question Link : https://leetcode.com/problems/trapping-rain-water/
Difficulty: Hard
Premium: False
Question
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 …
Continue reading