Trapping Rain Water - Leetcode 42

Problem - Leetcode 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 rain. Example 1: Input: height = [0,1,0,2,1,0,1,3,2,1,2,1] Output: 6 Explanation: The above ele...