Leetcode 3113. Find the Number of Subarrays Where Boundary Elements Are Maximum

Count the subarrays whose first and last elements are equal and also equal to the maximum value in that subarray. The challenge is to do this faster than brute force by handling duplicates and ensuring no larger element lies between the chosen endpoints (typically requiring linear or n log n techniques).