Leetcode 2393. Count Strictly Increasing Subarrays

Count the number of contiguous subarrays whose elements are strictly increasing; the core challenge is to identify maximal strictly increasing runs and aggregate how many subarrays each run contributes to compute the total efficiently (typically in O(n) time and O(1) extra space).