Medium
Quiz
#581 Shortest Unsorted Continuous Subarray
APPROACH
Given an integer array nums, identify the shortest contiguous subarray that, when sorted in ascending order, causes the entire array to become sorted. Return the length of that subarray.
Example 1:
Input: nums = [2,6,4,8,10,9,15]
Output: 5
Explanation: You need to sort [6, 4, 8, 10, 9] in ascending order to make the whole array sorted in ascending order.
Example 2:
Input: nums = [1,2,3,4]
Output: 0
Example 3:
Input: nums = [1]
Output: 0
1 of 4
1:00
What is the optimal approach for this problem?