We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
count=0
for x in range(0, len(arr)-1):
if arr[x]!=x+1:
b=arr.index(min(arr[x+1:len(arr)]))
arr[x], arr[b]= arr[b],arr[x]
count+=1
else:
continue
return count
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Minimum Swaps 2
You are viewing a single comment's thread. Return to all comments →
My solution in Python: