Solution with only one loop

Better solution

Example Test Case [1, 1, 1, 1, 1] violates constraint

Why does this solution not contain the line if nums[i] != i + 1: # Check if the current element is in its correct position

It's possible to track the duplicates while performing the cyclic sort. I think ...

When I try [3, 1, 3, 4, 2] as the input, the nums list looks like [1, 2, 3, 4, ...

For the first example, the input array after a cycle sort is performed on it is ...