Leetcode 1574. Shortest Subarray to be Removed to Make Array Sorted
Given an array, remove the shortest contiguous subarray (possibly empty) so that the remaining elements — the concatenation of a prefix and a suffix — are non-decreasing. The core approach is to exploit the maximal non-decreasing prefix and suffix and merge them (via two-pointer/binary-search) to minimize the removed length; n ≤ 10^5.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.