Easy · Bit Manipulation · about 15 minutes
Asked at Amazon, Google.
An array nums should contain 1..n exactly once, but one number got duplicated, replacing another. Return [duplicate, missing].
nums
[duplicate, missing]