Subarray Removal

Problem Overview

• Given an integer array, count contiguous subarrays whose removal leaves a non-empty array sorted in increasing order.
• Input: n (1 ≤ n ≤ 2×10^5) and arr[i] (1 ≤ arr[i] ≤ 10^9); Output: the number of such subarrays.
• Context: array processing and sequence validation, relevant to data cleanup and monotonic sequence checks.
• A coding interview problem and interview question from Deshaw interviews.