email: alex.alanen@gmail.com Discord: Sawyer#8347 —
I’m interested in web development
CodeWars <6kyu>: Given an array of integers, find the one that appears and odd number of time. There will always be only one integer that appears and odd number of times.
#include <vector>
int findOdd(const std::vector<int>& numbers)
{
int val;
int coinc;
for(size_t i = 0; i < numbers.size(); i++)
{
val=numbers[i];
coinc=0;
for(int j:numbers)
{
if(val==j)
coinc++;
}
if(coinc%2!=0)
return val;
}
}
English - B1 Russian - Native