Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Solution: Find the Corrupt Pair

Explore how to identify the corrupt pair in an unsorted array containing numbers from 1 to n with one duplicate and one missing. Learn to apply cyclic sort to position elements correctly and then locate the duplicated and missing values in a single pass, all with optimal time and space complexity.

We'll cover the following...

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 ...