This was the question asked in F2F interview to me - "Given an array of size "N" - say M = number of subarrays in the array whose sum is even ; you can change any number at index "i" to any number "X" you want - You are allowed to do this operation at most once - Maximize the value of "M" by selecting the optimal index"
Please Help
1<=N<=100000