I think there is a simpler way: for any integer[i], just check its sum with [i - 1] and [i - 2] for an odd number, since the array size is at least 3. We cannot use i + 1 because of the last integer would have out of range problem.
I've seen some very clever and concise solutions! But as I read the really concise ones, they require reading the whole input. The question states that the input might be very long! For best practice, I'd like to see solutions that can exit as soon as the answer is known, without reading the rest of the intput.
I think there is a simpler way: for any integer[i], just check its sum with [i - 1] and [i - 2] for an odd number, since the array size is at least 3. We cannot use i + 1 because of the last integer would have out of range problem.
I've seen some very clever and concise solutions! But as I read the really concise ones, they require reading the whole input. The question states that the input might be very long! For best practice, I'd like to see solutions that can exit as soon as the answer is known, without reading the rest of the intput.
Could it be that your output contains duplicate elements?