All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space | Algorithms
You are given an array that contains integers. The integers content is such that every integer occurs 3 times in that array leaving one integer that appears only once. Fastest way to find that single integer -- using memory. -- not using any external memory.
Post to Tumblr