Search⌘ K
AI Features

Solution: Find the Corrupt Pair

Explore how to use cyclic sort to detect the missing and duplicated numbers in an unsorted array. This lesson teaches an efficient single-pass approach that swaps elements to their correct positions and identifies the corrupt pair by comparing indices, helping you apply a common coding interview pattern effectively.

Statement

We are given an unsorted array, nums, with nn elements and each element is in the range [1,n][1, n] inclusive. The array originally contained all the elements from 11 to nn but due to a data error, one of the numbers is duplicated, which causes another number missing. Find and return ...