You’re given an integer array, arr. Return a resultant array so that res[i] is equal to the product of all the elements of arr except arr[i].

Write an algorithm that runs in $O(n)$ time without using the division operation.

Constraints:

• $2 \leq$ arr.length $\leq 10^3$
• $-30 \leq$ arr[i] $\leq 30$
• The product of any prefix or suffix of arr is guaranteed to fit in a 32-bit integer.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

Implement your solution in the following coding playground: