JobsJob TrackerJob alerts

WheelsEye ยท 8 questions

All 8Coding 8
  • Minimum Magician Tricks for Ordering Wise and Strong PeopleCoding
  • Sum of Values with Different Parity from IndexCoding
  • Lexicographically Smallest String Based on Substring ConditionsCoding
  • Search a 2D MatrixCoding
  • Search in rotated array, max sum non-adjacent, matrix adjacent checkCoding
  • Candies distribution, tree split edge, queue using stacksCoding
  • Implement Map, sort stack, and largest sum subarrayCoding
  • Sliding window maximum, egg dropping puzzle, and jail puzzleCoding
โ† WheelsEye questions
  1. Interview questions
  2. WheelsEye
  3. Sum of Values with Different Parity from Index
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

  • Minimum Magician Tricks for Ordering Wise and Strong People
  • Lexicographically Smallest String Based on Substring Conditions
  • Search in rotated array, max sum non-adjacent, matrix adjacent check
  • Candies distribution, tree split edge, queue using stacks
  • Implement Map, sort stack, and largest sum subarray
โ† Minimum Magician Tricks for Ordering Wise and Strong PeopleLexicographically Smallest String Based on Substring Conditions โ†’

Collected from public candidate posts and coding forums. Updated Nov 2026.