Leetcode 2972. Count the Number of Incremovable Subarrays II

Count the non-empty contiguous subarrays whose removal makes the remaining array strictly increasing. With n up to 1e5, the task is to efficiently combine prefix/suffix strictly-increasing runs and check boundary joins to count valid removals.