Given an input array A, return a product array B such that each element in B is the product of all elements of A except the element at the same index in A. The required time complexity is O(N) and you are not allowed to use the division operator.
[1, 2, 3, 4, 5] => [120, 60, 40, 30, 24]
- Time : O(N)
- Space: O(N)
- Complete the required APIs in
question.cto attempt this question. - Please don't edit the function prototype provided in
question.c, your . solution might not compile if you do. - If you need hints to solve the problem, look at
hints.cinstead. - When you're done, compile your changes by running:
make all - Test your code using:
./question < input.txtor./hints < input.txt. - The solution is available in
answer.c(compile using:make answer) - Get the expected output using:
./answer < input.txt - Feel free to include any additional header files or define additional functions.
If you have an alternative solution to any of the solutions we've posted that is more optimal or uses a different approach, please email it to us at [email protected]. If it compiles and passes our unit-tests, we will feature your solution and give you credit for it.