[1, 7, 3, 4]

[84, 12, 28, 21]

[7 * 3 * 4, 1 * 3 * 4, 1 * 7 * 4, 1 * 7 * 3]

Does your method work if the input array contains zeroes? Remember—no division.

We can do this in time and space!

We only need to allocate one new array of size n.

A brute force approach would use two loops to multiply the integer at every index by the integer at every nested_index, unless index == nested_index.

This would give us a runtime of . Can we do better?

Well, we’re wasting a lot of time doing the same calculations. As an example, let's take:

We're doing some of the same multiplications two or three times!

Or look at this pattern:

We’re redoing multiplications when instead we could be storing the results! This would be a great time to use a greedy approach. We could store the results of each multiplication highlighted in blue, then just multiply by one new integer each time.

So in the last highlighted multiplication, for example, we wouldn’t have to multiply 1*2*6 again. If we stored that value (12) from the previous multiplication, we could just multiply 12*5.

Can we break our problem down into subproblems so we can use a greedy approach?

Let's look back at the last example:

What do all the highlighted multiplications have in common?

They are all the integers that are before each index in the input array ([1, 2, 6, 5, 9]). For example, the highlighted multiplication at index 3 (1*2*6) is all the integers before index 3 in the input array.

Do all the multiplications that aren't highlighted have anything in common?

Yes, they're all the integers that are after each index in the input array!

Knowing this, can we break down our original problem to use a greedy approach?

The product of all the integers except the integer at each index can be broken down into two pieces:

1. the product of all the integers before each index, and
2. the product of all the integers after each index.

To start, let's just get the product of all the integers before each index.

How can we do this? Let's take another example:

Notice that we're always adding one new integer to our multiplication for each index!

So to get the products of all the integers before each index, we could greedily store each product so far and multiply that by the next integer. Then we can store that new product so far and keep going.

So how can we apply this to our input array?

Let’s make an array products_of_all_ints_before_index:

So we solved the subproblem of finding the products of all the integers before each index. Now, how can we find the products of all the integers after each index?

It might be tempting to make a new array of all the values in our input array in reverse, and just use the same method we used to find the products before each index.

Is this the best way?

This method will work, but:

1. We'll need to make a whole new array that's basically the same as our input array. That's another memory cost!
2. To keep our indices aligned with the original input array, we'd have to reverse the array of products we return. That's two reversals, or two operations!

Is there a cleaner way to get the products of all the integers after each index?

We can just walk through our array backwards! So instead of reversing the values of the array, we'll just reverse the indices we use to iterate!

Now we've got products_of_all_ints_after_index, but we’re starting to build a lot of new arrays. And we still need our final array of the total products. How can we save space?

Let’s take a step back. Right now we’ll need three arrays:

1. products_of_all_ints_before_index
2. products_of_all_ints_after_index
3. products_of_all_ints_except_at_index

To get the first one, we keep track of the total product so far going forwards, and to get the second one, we keep track of the total product so far going backwards. How do we get the third one?

Well, we want the product of all the integers before an index and the product of all the integers after an index. We just need to multiply every integer in products_of_all_ints_before_index with the integer at the same index in products_of_all_ints_after_index!

Let's take an example. Say our input array is [2, 4, 10]:

We'll calculate products_of_all_ints_before_index as:

And we'll calculate products_of_all_ints_after_index as:

If we take these arrays and multiply the integers at the same indices, we get:

And this gives us what we're looking for—the products of all the integers except the integer at each index.

Knowing this, can we eliminate any of the arrays to reduce the memory we use?

Yes, instead of building the second array products_of_all_ints_after_index, we could take the product we would have stored and just multiply it by the matching integer in products_of_all_ints_before_index!

So in our example above, when we calculated our first (well, "0th") "product after index" (which is 40), we’d just multiply that by our first "product before index" (1) instead of storing it in a new array.

How many arrays do we need now?

Just one! We create an array, populate it with the products of all the integers before each index, and then multiply those products with the products after each index to get our final result!

products_of_all_ints_before_index now contains the products of all the integers before and after every index, so we can call it products_of_all_ints_except_at_index!

Almost done! Are there any edge cases we should test?

What if the input array contains zeroes? What if the input array only has one integer?

We'll be fine with zeroes.

But what if the input array has fewer than two integers?

Well, there won't be any products to return because at any index there are no “other” integers. So let's raise an exception.

def get_products_of_all_ints_except_at_index(int_array) if int_array.length < 2 raise IndexError, 'Getting the product of numbers at other indices requires at least 2 numbers' end products_of_all_ints_except_at_index = [] # For each integer, we find the product of all the integers # before it, storing the total product so far each time. product_so_far = 1 i = 0 while i < int_array.length products_of_all_ints_except_at_index[i] = product_so_far product_so_far *= int_array[i] i += 1 end # For each integer, we find the product of all the integers # after it. Since each index in products already has the # product of all the integers before it, now we're storing # the total product of all other integers. product_so_far = 1 i = int_array.length - 1 while i >= 0 products_of_all_ints_except_at_index[i] *= product_so_far product_so_far *= int_array[i] i -= 1 end products_of_all_ints_except_at_index end