Find the Corrupt Pair
Explore how to detect the corrupt pair in an unsorted array containing numbers from 1 to n with one duplicate and one missing value. Learn to apply the cyclic sort pattern to efficiently find the missing and duplicated elements. This lesson helps you understand problem-solving strategies for array corruption issues commonly encountered in coding interviews.
We'll cover the following...
Statement
We are given an unsorted array, nums, with elements and each element is in the range inclusive. The array originally contained all the elements from to but due to a data error, one of the numbers is duplicated, which causes another number missing. Find and return the corrupt pair (missing, duplicated).
Constraints:
-
nums[i]
Examples
Understand the problem
Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:
Find the Corrupt Pair
Which is the corrupt pair in the array given below?
[4, 1, 3, 4, 5]
2, 3
2, 4
2, 5
2, 6
Figure it out!
We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.
Try it yourself
Implement your solution in the following coding playground:
def find_corrupt_pair(nums):# Replace this placeholder return statement with your codereturn []