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

Solution: Find the Corrupt Pair

Explore how to find the missing and duplicate numbers in an unsorted array using cyclic sort. This lesson guides you through placing elements at correct indices and detecting corrupt pairs efficiently in linear time and constant space.

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 the corrupt pair ...