Skip to content

Practice Remove One Element to Make the Array Strictly Increasing

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#1909
LeetCode Problem

Remove One Element to Make the Array Strictly Increasing

Problem Statement

Given a 0-indexed integer array nums, return true if it can be made strictly increasing after removing exactly one element, or false otherwise. If the array is already strictly increasing, return true. The array nums is strictly increasing if nums[i - 1] < nums[i] for each index (1 <= i < nums.length).

Source: Remove One Element to Make the Array Strictly Increasing on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [1,2,10,5,7]
Output
true

# Example 2

Input
nums = [2,3,1,2]
Output
false

# Example 3

Input
nums = [1,1,1]
Output
false

Constraints

2 <= nums.length <= 1000
1 <= nums[i] <= 1000

Related LeetCode Problems

Practice more problems similar to Remove One Element to Make the Array Strictly Increasing.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.