O(n) 's more elegant solution

Another but simple solution (not in a cyclic sort fashion)

less confusing solution

One way to look at this is:Place all numbers in their correct position except n....

Why not compare i and j directly instead of doing nums[i] and nums[j]? Since the...

I feel like the examples are a bit misleading here. Would be useful to have anot...

An alternative solution if we consider that the sum of numbers: 1, 2, 3, ..., n ...