Count Special Index Pairs
Company: Google
Role: Data Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Technical Screen
Given an integer array `nums` of length `n`, count the number of index pairs `(i, j)` such that:
- `0 <= i < j < n`
- `nums[i] * nums[j]` is even
- `j - i` is odd
Return the total number of such special pairs.
A product is even if at least one of the two numbers is even.
Quick Answer: This question evaluates understanding of parity, combinatorial counting, and array index manipulation, focusing on reasoning about even/odd products and index parity constraints.