Mindbending Product Problem Statement

You are given an array ARR of size N. Your task is to create a Product Array P of the same size such that P[i] is the product of all the elements in ARR except ARR[i]. Note that you are not allowed to use the division operator.

Example:

Input:

ARR = [1, 2, 3, 4, 5]

Output:

[120, 60, 40, 30, 24]

Explanation:

The Product Array is created as follows:

• P[0] = 2 * 3 * 4 * 5 = 120
• P[1] = 1 * 3 * 4 * 5 = 60
• P[2] = 1 * 2 * 4 * 5 = 40
• P[3] = 1 * 2 * 3 * 5 = 30
• P[4] = 1 * 2 * 3 * 4 = 24

Constraints:

• 1 ≤ T ≤ 50
• 1 ≤ N ≤ 10
• 1 ≤ ARR[i] ≤ 20
• Time Limit: 1 sec