CodingMediumcod-g075

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

Question

Given an array a of distinct integers, return the minimum number of swaps (each swap exchanges any two positions) needed to sort the array in ascending order. The array length can be 1.

Implement

min_swaps_to_sort(a: list[int]) → int

Examples

in[[2,1,3,4]]out1

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.