[6kyu][algorithms] Find The Parity Outlier solution
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.
This commit is contained in:
@@ -0,0 +1,19 @@
|
||||
// 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.
|
||||
//
|
||||
//
|
||||
// [2, 4, 0, 100, 4, 11, 2602, 36] --> 11 (the only odd number)
|
||||
|
||||
// [160, 3, 1719, 19, 11, 13, -21] --> 160 (the only even number)
|
||||
//
|
||||
//
|
||||
|
||||
|
||||
export function findOUtlier(integers: number[]): number {
|
||||
|
||||
const isEvenNum = integers.filter(num => num % 2 == 0);
|
||||
const isOddNum = integers.filter(num => num % 2 != 0);
|
||||
|
||||
return isEvenNum.length == 1 ? Number(isEvenNum) : Number(isOddNum);
|
||||
};
|
||||
Reference in New Issue
Block a user