Findtheoddint.cpp

#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include <string>
#include <iostream>
using namespace std;
int findOdd(const vector<int>& numbers) {
	int result = 0;
	for (int i = 0; i < numbers.size(); i++)
	{
		if (count(numbers.begin(), numbers.end(), numbers[i]) % 2 == 1)
		{
			result = numbers[i];
		}
	}
	return result;
}

int main() {
	cout << findOdd({ 1,1,2,-2,5,2,4,4,-1,-2,5 });
	return 0;
}
/*Description:

Given an array of integers, find the one that appears an odd number of times.

There will always be only one integer that appears an odd number of times.
Examples

[7] should return 7, because it occurs 1 time (which is odd).
[0] should return 0, because it occurs 1 time (which is odd).
[1,1,2] should return 2, because it occurs 1 time (which is odd).
[0,1,0,1,0] should return 0, because it occurs 3 times (which is odd).
[1,2,2,3,3,3,4,3,3,3,2,2,1] should return 4, because it appears 1 time (which is odd).
Fundamentals*/