Count index pairs with an even product and odd distance
Given an integer array, count pairs i < j where nums[i] * nums[j] is even and j - i is odd. Avoid checking every pair: count even and odd values by index parity and combine.
GoogleTechnical phone screenNo answer yet. Write the first one; the best answer gets endorsed.