# C++ Solution to Coding Challenge 581. Shortest Unsorted Continuous Subarray

## Another way of sorting special arrays

3 min readJan 16, 2023

# Problem statement

Given an integer array `nums`

, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order.

Return the shortest such subarray and output its length.

## 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

## Constraints:

`1 <= nums.length <= 10^4`

.`-10^5 <= nums[i] <= 10^5`

.

**Follow up**: Can you solve it in `O(n)`

time complexity?

# Solution 1: Sort and compare the difference

## Example 1

Comparing `nums = [2,6,4,8,10,9,15]`

with its sorted one `sortedNums = [2,4,6,8,9,10,15]`

:

- The first position that…