Christopher SuAbout Blog Projects Contact More

Problem

Given an array of numbers where every distinct number appears twice in the array except one, which is repeated three times, find the one number that appears three times (the triplicate).

Solution

Solution is in \( O(N) \) time and \( O(1) \) space.