← All problemsSign in

3818. Minimum Prefix Removal to Make Array Strictly Increasing

LeetCodeArrayOpen on judge ↗

You are given an integer array nums. You need to remove exactly one prefix (possibly empty) from nums. Return an integer denoting the minimum length of the removed prefix such that the remaining array is strictly increasing. Example 1: Input: nums = [1,-1,2,3,3,4,5] Output: 4 Explanation: Removing the prefix = [1, -1, 2, 3] leaves the remaining array [3, 4, 5] which is strictly increasing

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start