Leetcode 42. Trapping Rain Water

Given an array of non-negative heights representing elevation bars of width 1, compute the total units of water that can be trapped between them after raining. The core challenge is determining, for each position, the bounding left and right maxima to accumulate trapped volume efficiently (ideally in linear time).