Search⌘ K
AI Features

Solution: Find the Corrupt Pair

Explore how to solve the corrupt pair problem by using cyclic sort to place elements in correct positions. Understand the single-pass approach to detect the missing and duplicated number with optimized time and space complexity in C#.

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