Problem of the day
Each product can cross the integer limits, so we should take modulo of the operation.
Take MOD = 10^9 + 7 to always stay in the limits.
Can you try solving the problem in O(1) space?
The first line contains an integer 'T' which denotes the number of test cases or queries to be run. Then the test cases follow.
The first line of each test case or query contains an integer 'N' representing the size of the array/list.
The second line contains 'N' single space-separated integers representing the elements in the array/list.
For each test case, print the elements of the 'PRODUCT' array separated by a single space.
Output for every test case will be printed in a separate line.
You are required to return the product array and no need to print the result explicitly. It has already been taken care of.
1 <= T <= 100
0 <= N <= 10^5
0 <= ARR[i] <= 10^5
Time Limit: 1 sec
2
3
1 2 3
3
5 2 2
6 3 2
4 10 10
Test case 1 : Given array = {1, 2, 3]
Required array = [2 * 3, 1 * 3, 1 * 2] = [6, 3, 2]
Test case 2 : Given array = {5, 2, 2]
Required array = [2 * 2, 5 * 2, 5 * 2] = [4, 10, 10]
2
1
100
2
1 2
1
2 1