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[]} nums3 * @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 ? 010 : same.lastIndexOf(false) - same.indexOf(false) + 111}
Comments
Loading comments...
Tags
leetcode
array
Apply and earn a $2,500 bonus once you're hired on your first job!
Clients from the Fortune 500 to Silicon Valley startups
Choose your own rate, get paid on time
From hourly, part-time, to full-time positions
Flexible remote working environment
A lot of open JavaScript jobs!!
Fact corner: Referred talent are 5x more likely to pass the Toptal screening process than the average applicant.
Still hesitate? Read HoningJS author's guide on dealing with Toptal interview process.