Top 150 InterviewEasy

Find The Duplicate Number

Detailed guide and Python implementation for the 'Find The Duplicate Number' problem.

Problem Statement

Easy

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.

Implement a function findDuplicate(nums: list) -> int that returns the duplicate number.

Constraints
  • 1 <= n <= 100000
  • nums.length == n + 1
  • 1 <= nums[i] <= n
  • There is only one repeated number in nums, but it could be repeated more than once

Examples

Example 1
Input
[1,3,4,2,2]
Output
2
Explanation

The duplicate number is 2. It appears twice in the array.

Example 2
Input
[3,1,3,4,2]
Output
3
Explanation

The duplicate number is 3. It appears twice in the array.

Example 3
Input
[3,3,3,3,3]
Output
3
Explanation

The duplicate number is 3. It appears five times.

Need a Hint?
Consider using Linked List-specific data structures like sets or heaps.
Edge Cases to Watch
  • Empty input structures
  • Single element inputs
  • Large numerical bounds

Ready to Solve?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

Open in Editor

Recommended Python Resources

Expand your knowledge with related interactive tutorials, cheat sheets, and code comparisons.