Scribd
Upload
14 views2 pages

Find The Duplicate Number - LeetCode

The document describes a coding problem titled 'Find the Duplicate Number' which requires identifying a repeated integer in an array of integers without modifying the array and using constant extra space. It provides example inputs and outputs, as well as constraints on the input values. Additionally, it poses follow-up questions regarding the proof of the existence of a duplicate and the possibility of solving the problem in linear runtime complexity.

Uploaded by

Hitesh Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views2 pages

Find The Duplicate Number - LeetCode

The document describes a coding problem titled 'Find the Duplicate Number' which requires identifying a repeated integer in an array of integers without modifying the array and using constant extra space. It provides example inputs and outputs, as well as constraints on the input values. Additionally, it poses follow-up questions regarding the proof of the existence of a duplicate and the possibility of solving the problem in linear runtime complexity.

Uploaded by

Hitesh Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Description Editorial Solutions Submissions

287. Find the Duplicate Number

Medium 22K 3.9K

Companies

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 uses only constant extra
space.

Example 1:

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


Output: 2

Example 2:

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


Output: 3

Constraints:

1 <= n <= 105

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.

Follow up:
:
How can we prove that at least one duplicate number must exist in nums ?

Can you solve the problem in linear runtime complexity?


:

You might also like