Tap here to switch tabs
Problem
Submissions

Problem: Find the Corrupt Pair

Find the Corrupt Pair asks you to inspect an unsorted array containing numbers from one through its length, with one missing and another duplicated. Return both in that order.

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 (missing, duplicated).

Constraints:

  • 2≤n≤1032 \leq n \leq 10^3
  • 1≤1 \leq nums[i] ≤n\leq n
⋮
Tap here to switch tabs
Problem
Submissions

Problem: Find the Corrupt Pair

Find the Corrupt Pair asks you to inspect an unsorted array containing numbers from one through its length, with one missing and another duplicated. Return both in that order.

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 (missing, duplicated).

Constraints:

  • 2≤n≤1032 \leq n \leq 10^3
  • 1≤1 \leq nums[i] ≤n\leq n