# [CodeWars] Find the Parity Outlier

You are given an array (which will have a length of at least 3, but could be very large) containing integers. The array is either entirely comprised of odd integers or entirely comprised of even integers except for a single integer `N`. Write a method that takes the array as an argument and returns this “outlier” `N`.

## Examples

 [2, 4, 0, 100, 4, 11, 2602, 36]Should return: 11 (the only odd number) [160, 3, 1719, 19, 11, 13, –21]Should return: 160 (the only even number) cs

### My Solution

 #include  int FindOutlier(std::vector arr){    std::vector odd, even;     for (std::vector::const_iterator i = arr.begin(); i != arr.end(); ++i)        abs(*i%2) == 1 ? odd.push_back(*i) : even.push_back(*i);     return odd.size() > even.size() ? even.at(0) : odd.at(0);}Colored by Color Scripter cs

I used two vector arrays, odd, even. If the input element of array is odd number, put the number to odd vector. If not, put it to even vector.

To find parity number, compare two vector arrays. then, returns the first element of smaller array.

## 글쓴이: BakJH

Student of Daedeok SW Meister Highschool, in Korea.