Array of Array Products

[esthicodes]

Given an array of integers arr, you’re asked to calculate for each index i the product of all integers except the integer at that index (i.e. except arr[i]). Implement a function arrayOfArrayProducts that takes an array of integers and returns an array of the products.

Solve without using division and analyze your solution’s time and space complexities.

`input: arr = [8, 10, 2]
output: [20, 16, 80] # by calculating: [102, 82, 8*10]

input: arr = [2, 7, 3, 4]
output: [84, 24, 56, 42] # by calculating: [734, 234, 274, 273]`

Constraints:

[time limit] 5000ms

[input] array.integer arr

0 ≤ arr.length ≤ 20
[output] array.integer

[esthicodes]

def array_of_array_products(arr):
  if not arr:
    return []
  if len(arr)==1:
    return []
  left = [1]
  
  right = [1]# 2 20 160 ]
  #[8,10,2]
  for num in arr:
    left.append(left[-1]*num)
    
  N=len(arr)
  for i in range(N-1,-1,-1):
    num = arr[i]
    right.append(right[-1]*num)
    
#   [8, 10, 2]
 # left [1 8 80 160]
  #right = [160, 20, 2, 1]
  #
 #output= [20, 16, 80]
  
  newright = []
  while right:
    newright.append(right.pop())
  right = newright
  
  ans= []
  #print(left,right)
  for i in range(N):
    ans.append(left[i] * right[i+1])
  return ans
  
x = [8,10,2]
print(array_of_array_products(x))