CodingEasy
Sum of Values with Different Parity from Index
Filed under WheelsEye
The question
Given an integer array A of size N using 1-based indexing, find the sum of values of A[i] for all elements where the parity of the value is different from the parity of its index i.
No write-up yet. Related questions below have one.
Related WheelsEye questions
Collected from public candidate posts and coding forums. Updated Nov 2026.