Leetcode 1063. Number of Valid Subarrays

Count the number of contiguous subarrays that satisfy a local ordering constraint (e.g., the first element remains the min/max over the subarray). The core challenge is for each index to determine how far its subarrays can extend before a violating element appears — typically solved in O(n) using a monotonic stack / next-smaller/greater pattern.