Minimum swaps to sort array
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]) → intExamples
in
[[2,1,3,4]]out1What 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 30 min
solution.py
InputExpectedGot
[[2,1,3,4]]1not run yetsample