← Questions
Count index pairs with an even product and odd distance
0
I was asked this
No reports yet. Sign in to say where you were asked it.
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.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding