Hang on...
N-Repeated Element in Size 2N Array Lab
In this lab, you will work with a problem that focuses on finding the N-repeated element in an array of size 2N. You will be given an integer array nums
with the following properties:
nums.length == 2 * n
.nums
containsn + 1
unique elements.- Exactly one element of
nums
is repeatedn
times.
Your task is to write a function, repeatedNTimes
, that returns the element that is repeated n
times.
Example 1:
Input: nums = [1,2,3,3]
Output: 3
Example 2:
Input: nums = [2,1,2,5,3,2]
Output: 2
Example 3:
Input: nums = [5,1,5,2,5,3,5,4]
Output: 5
Constraints:
2 <= n <= 5000
nums.length == 2 * n
0 <= nums[i] <= 104
nums
containsn + 1
unique elements and one of them is repeated exactlyn
times.
Challenges
- Implement the
repeatedNTimes
function to find the N-repeated element in the array. - Ensure your function works correctly with the provided examples and any additional edge cases.
Adding your container request
Getting your dedicated container
Connecting to your container
Setting up your editor
Finalizing your playground
TerminalEditorBrowser