Published in


C++ Solution to Coding Challenge 287. Find the Duplicate Number

The Pigeonhole principle

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.



LeetSolve shares how to solve a coding question in C++. The questions are selected from leetcode.com. You can learn from LeetSolve’s posts essential algorithms, basic data structures, elementary C++ programming language and common coding techniques.

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store