Leetcode 3061. Calculate Trapping Rain Water

Given an array of non-negative heights representing elevation bars, compute the total amount of water that can be trapped after rainfall. The core challenge is, for each index, to determine the limiting left/right maxima and sum max(0, min(left_max, right_max) − height) efficiently (optimal solutions run in O(n) time with constant or linear extra space).