Skip to content

Latest commit

 

History

History
23 lines (15 loc) · 422 Bytes

README.md

File metadata and controls

23 lines (15 loc) · 422 Bytes

Product of every position

This problem was asked by Uber.

Description

Given an array of integers, return a new array such that each element at index i of the new array is the product of all the numbers in the original array except the one at i.

Examples

Input:  [1, 2, 3, 4, 5]
Output: [120, 60, 40, 30, 24]
Input:  [3, 2, 1]
Output: [2, 3, 6]

Challenge

What if you can't use division?