Finding the duplicate number in the array using Java

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

Sample Input:
[3,1,3,4,2]

Sample Output:
3

Please assign this question to me and add hacktoberfest label to it.