#include <stdio.h>
#include <stdlib.h>

#include "HashTable.h"

int oddOccurring_attempt1(int arr[], int size) {
	// Count in ht, how many times I see each value
	HashTable ht = HashTableNew();
	int oddCounter = 0;
	for(int i=0; i<size; i++) {
		int occurances = HashTableGetOrDefault(ht, arr[i], 0);
		occurances++;
		HashTableInsert(ht, arr[i], occurances);
		if(occurances % 2 == 1) {
			oddCounter++;
		} else {
			oddCounter--;
		}
	}

	HashTableFree(ht);

	return oddCounter;
}

int oddOccuring(int arr[], int size) {

	HashTable ht = HashTableNew();
	for(int i=0; i<size; i++) {
		// If current is in ht, remove it
		if (HashTableContains(ht, arr[i])) {
			HashTableDelete(ht, arr[i]);
		} else { // (it wasn't in the ht) insert it
			HashTableInsert(ht, arr[i], 0);
		}
	}

	int num = HashTableSize(ht);
	HashTableFree(ht);
	return num;
}