Sum of adjacent elements is always even

Given an array of integers A, find and return the minimum elements to be removed such that
in the resulting array the sum of any two adjacent values is even.



Input Format

The only argument given is the integer array A.

Output Format

Return the minimum number of elements to be removed.

Constraints

1 <= length of the array <= 100000
-10^9 <= A[i] <= 10^9 

For Example

Input 1:
    A = [1, 2, 3, 4, 5]
Output 1:
    2

Input 2:
    A = [5, 17, 100, 11]
Output 2:
    1
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.
Start solving Sum of adjacent elements is always even on Interview Code Editor
Sign Up
to access hints and editorial solutions for Sum of adjacent elements is always even

Discussion


Loading...
Click here to start solving coding interview questions