Shortest unsorted subarray
Given an integer array a, find the length of the shortest contiguous subarray that, if sorted in place, would make the entire array sorted in ascending order. If the array is already sorted, return 0.
Implement
shortest_unsorted_subarray(a: list[int]) → intExamples
in
[[2,6,4,8,10,9,15]]out5What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[[2,6,4,8,10,9,15]]5not run yetsample