Shortest Unsorted Continuous Subarray in 55 Sec
Shortest Unsorted Continuous Subarray in 55 Sec #leetcode #dsa #faangcodinginterviewpreparation #faang
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.