Find The Parity Outlier

 

Description:

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)

 

Code:

 

     static int FindOutlier(int[] integers)

    

     {

         int even=0,odd=0;

         for(int i=0;i<integers.length;i++)

         {

             

              if(integers[i]%2==0)

                  even++;

              else

                  odd++;

                 

         }

         if(even>odd)

         {

              //its an even array

              for(int i=0;i<integers.length;i++)

              {

                  if(integers[i]%2!=0)

                  {

                       return (integers[i]);

                  }

              }

             

         }

         else

         {

              //its an odd array

              for(int i=0;i<integers.length;i++)

              {

                  if(integers[i]%2==0)

                  {

                       return(integers[i]);

                  }

              }

         }

         return 0;    

     }


Images:

Find the Party Outlier



About Codewars

Codewars is an educational community for computer programming. On the platform, software developers train on programming challenges known as kata. These discrete programming exercises train a range of skills in a variety of programming languages, and are completed within an online integrated development environment.