Leetcode 2832. Maximal Range That Each Element Is Maximum in It

For each element in an array, find the largest contiguous subarray (range) in which that element is the maximum. This is typically solved by locating the nearest greater (or handling ties with greater-or-equal) neighbor to the left and right for each index—usually with monotonic stacks.