Remove Sub-Array

CodeChefOpen on judge ↗

You are given an array $A$ of $n$ integers as input. You have to remove a sub-array (can be empty) from the array $A$ to make it sorted, in increasing order. Find the minimum size of such a sub-array. ###Input: - First line will contain $n$, the number of elements of array. - Second line will contain array $A$ of $n$ integers. ###Output: Output the minimum size of a sub-array (can be em

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