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.
dynamic programming
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.