# 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.