Given an array A of size N, construct a Product Array P (of same size) such that P is equal to the product of all the elements of A except A[i].
The first line of input contains an integer T denoting the number of test cases. T testcases follow. Each testcase contains two lines of input. The first line is N. The second line contains N elements separated by spaces. It is guranteed that the product of all the elements of the array will not exceed 1e18.
For every test case, print the product array in a new line.
You do not have to read input. Your task is to complete productExceptSelf() function and returns the Product vector P that holds product except for self at each index.
1 <= T <= 100
1 <= N <= 1000
0 <= Ai <= 200
10 3 5 6 2
180 600 360 300 900
Testcase1: For the product array P, at i=0 we have 3*5*6*2. At i=1 10*5*6*2. At i=2 we have 10*3*6*2. At i=3 we have 10*3*5*2. At i=4 we have 10*3*5*6
So P is 180 600 360 300 900
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.