Leetcode 795. Number of Subarrays with Bounded Maximum

Count the number of contiguous subarrays whose maximum element lies in the inclusive range [left, right]. Solve efficiently with a linear scan by counting subarrays with max ≤ right minus those with max < left (i.e., sliding-window/segment counting).