CodingMediumcod-g091

Subject SortingLevel Mid–Senior~25 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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]) → int

Examples

in[[2,6,4,8,10,9,15]]out5

What 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.