# [OddOccurrencesInArray](https://app.codility.com/programmers/lessons/2-arrays/odd_occurrences_in_array/)

:::spoiler Solution

#include <bits/stdc++.h>

using namespace std;

int solution(vector<int> &A)
{
    unordered_map<int, int> countMap;
    for (auto a : A) ++countMap[a];

    for (auto [k, v] : countMap)
    {
        if (v % 2 == 0) continue;
        return k;
    }
}

- 時間複雜度：$O(n)$
- 空間複雜度：$O(n)$
:::