Given an array A of n integers, construct an array B such that each element B[i] contains the product of all numbers in array A except A[i]. Solve without using division and in O(n) time.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.