SimpleMultiplication

Input n integers: a₀, a₁, a₂... a_n

Output: An array {a₁.a₂...a_n , a₀.a₂...a_n , a₀.a₁...a_n , a₁.a₂...a_n-1 } Such the element at i^th location would be multiple of all integers except a_i

Solutions:

Brute force : O(n²)

Division Method : create a variable: a₀.a₁...a_n . Iterate it, for each iteration, divide it with i^th element. O(n)

Do not use Division : Start filling the array with with a₀.a₁...a_i-1 for i^th element. Then, do the reverse, multiplying with the number in the array. O(n)