Tap here to switch tabs
Problem
Submissions

Problem: Find All Duplicates in an Array

Find All Duplicates in an Array returns values appearing twice in an array whose numbers range from one through its length. Each value appears once or twice, with constant extra space required.

Statement

Given an integer array, nums, of length nn, where all the integers of nums are in the range [1,n][1, n] and each integer appears once or twice, return an array of all the integers that appear twice.

Note: Write an algorithm that runs in O(n)O(n) time and uses only constant auxiliary space, excluding the space occupied by the output.

Constraints:

  • n=n = nums.length

  • 1≤n≤1031 \leq n \leq 10^3

  • 1≤1 \leq nums[i] ≤n\leq n

  • Each element in nums appears once or twice.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Find All Duplicates in an Array

Find All Duplicates in an Array returns values appearing twice in an array whose numbers range from one through its length. Each value appears once or twice, with constant extra space required.

Statement

Given an integer array, nums, of length nn, where all the integers of nums are in the range [1,n][1, n] and each integer appears once or twice, return an array of all the integers that appear twice.

Note: Write an algorithm that runs in O(n)O(n) time and uses only constant auxiliary space, excluding the space occupied by the output.

Constraints:

  • n=n = nums.length

  • 1≤n≤1031 \leq n \leq 10^3

  • 1≤1 \leq nums[i] ≤n\leq n

  • Each element in nums appears once or twice.