Leetcode Problem 1574. Shortest Subarray to be Removed to Make Array Sorted

1574. Shortest Subarray to be Removed to Make Array Sorted

Leetcode Solutions

Two Pointers Approach

  1. Initialize two pointers, left and right, to the start and end of the array respectively.
  2. Move left forward until it points to the last element of the longest non-decreasing subarray starting from the beginning.
  3. Move right backward until it points to the first element of the longest non-decreasing subarray from the end.
  4. Initialize result to the minimum of the length of the array minus left - 1 and right, as these represent the lengths of subarrays that can be removed from either end.
  5. Use a while loop to iterate with two pointers, i starting from 0 and j starting from right. If arr[j] is greater than or equal to arr[i], update result to the minimum of result and j - i - 1, and increment i. Otherwise, increment j.
  6. Continue the loop until i exceeds left or j reaches the end of the array.
  7. Return result as the length of the shortest subarray to remove.
UML Thumbnail

Dynamic Programming Approach

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...