LeetCode: Shortest Unsorted Continuous Subarray Solution

Approach

Create a sorted version

Answer is the distance from first diff to last diff

Implementation

1/**
2 * @param {number[]} nums
3 * @return {number}
4 */
5var findUnsortedSubarray = function (nums) {
6  const sortedNums = [...nums].sort((a, b) => a - b)
7  const same = nums.map((num, i) => num === sortedNums[i])
8  return same.every(Boolean)
9    ? 0
10    : same.lastIndexOf(false) - same.indexOf(false) + 1
11}