Given an array of integers where some numbers repeat 1 time, some numbers repeat 2 times and only on
- by SS
Given an array of integers where some numbers repeat 1 time, some numbers repeat 2 times and only one number repeats 3 times, how do you find the number that repeat 3 times. Using hash was not allowed. Complexity of algorithm should be O(n)