Practice Shortest Unsorted Continuous Subarray
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Medium#581
LeetCode ProblemShortest Unsorted Continuous Subarray
Problem Statement
Given an integer array nums, you need to find one continuous subarray such that if you only sort this subarray in non-decreasing order, then the whole array will be sorted in non-decreasing order. Return the shortest such subarray and output its length.
Source: Shortest Unsorted Continuous Subarray on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [2,6,4,8,10,9,15]
Output
5
# Example 2
Input
nums = [1,2,3,4]
Output
0
# Example 3
Input
nums = [1]
Output
0
Constraints
1 <= nums.length <= 10^4
-10^5 <= nums[i] <= 10^5
Related LeetCode Problems
Practice more problems similar to Shortest Unsorted Continuous Subarray.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.