If space is a constraint: Iterate over the array, inserting each int into a set. Delete from set if encountered int is present. Thus at the end of array iteration, the set contains only odd-counted ints. Output set's values. O(n) average time, O(k) extra space where k is number of distinct elements with odd frequency of occurrence.