← All problemsSign in

3523. Make Array Non-decreasing

LeetCodeArrayStackGreedyMonotonic StackOpen on judge ↗

You are given an integer array nums. In one operation, you can select a subarray and replace it with a single element equal to its maximum value. Return the maximum possible size of the array after performing zero or more operations such that the resulting array is non-decreasing. Example 1: Input: nums = [4,2,5,3,5] Output: 3 Explanation: One way to achieve the maximum size is: - Replace

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