Practice Count the Number of Incremovable Subarrays I
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Count the Number of Incremovable Subarrays I
Problem Statement
You are given a 0-indexed array of positive integers nums. A subarray of nums is called incremovable if nums becomes strictly increasing on removing the subarray. For example, the subarray [3, 4] is an incremovable subarray of [5, 3, 4, 6, 7] because removing this subarray changes the array [5, 3, 4, 6, 7] to [5, 6, 7] which is strictly increasing. Return the total number of incremovable subarrays of nums. Note that an empty array is considered strictly increasing. A subarray is a contiguous non-empty sequence of elements within an array.
Source: Count the Number of Incremovable Subarrays I on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
nums = [1,2,3,4]
10
# Example 2
nums = [6,5,7,8]
7
# Example 3
nums = [8,7,6,6]
3
Constraints
Related LeetCode Problems
Practice more problems similar to Count the Number of Incremovable Subarrays I.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.