Skip to content

Practice Find the Duplicate Number

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#287
LeetCode Problem

Find the Duplicate Number

Problem Statement

Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive. There is only one repeated number in nums, return this repeated number. You must solve the problem without modifying the array nums and using only constant extra space.

Source: Find the Duplicate Number on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [1,3,4,2,2]
Output
2

# Example 2

Input
nums = [3,1,3,4,2]
Output
3

# Example 3

Input
nums = [3,3,3,3,3]
Output
3

Constraints

1 <= n <= 10^5
nums.length == n + 1
1 <= nums[i] <= n
All the integers in nums appear only once except for precisely one integer which appears two or more times.

Related LeetCode Problems

Practice more problems similar to Find the Duplicate Number.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.