Removable Subarray Counter

Problem Statement

Removable Subarray Counter Problem Description You are given a 0-indexed array of positive integers. A subarray is considered "removable" if removing it from the original array results in a strictly increasing sequence. Your task is to count the total number of such removable subarrays in the given array. Note that a strictly increasing array means each element is greater than the previous one, and an empty array is considered strictly increasing. A subarray must be a contiguous non-empty sequence of elements. Function Description You need to implement the function countRemovableSubarrays that takes the size of array and an array of positive integers, and returns the count of all subarrays whose removal would make the remaining array strictly increasing. Function Parameters n : An integer representing the size of the array arr : An array of n positive integers Input Format First line contains a single integer n, the number of elements in the array Second line contains n space-separated