## Given an array of numbers, return array of products of all other numbers (no division)

I was asked this question in a job interview, and I’d like to know how others would solve it. I’m most comfortable with Java, but solutions in other languages are welcome.

Given an array of numbers, `nums`

, return an array of numbers `products`

, where `products[i]`

is the product of all `nums[j], j != i`

.

```
Input : [1, 2, 3, 4, 5]
Output: [(2*3*4*5), (1*3*4*5), (1*2*4*5), (1*2*3*5), (1*2*3*4)]
```