Given an integer array <code>nums</code>, return an array <code>answer</code> such that <code>answer[i]</code> is equal to the product of all the elements of <code>nums</code> except <code>nums[i]</code>.
The product of any prefix or suffix of <code>nums</code> is guaranteed to fit in a 32-bit integer.
You must write an algorithm that runs in <code>O(n)</code> time and without using the division operation.
Example 1:
<pre><code class="lang-java">Input: nums = [1,2,3,4]
Output: [24,12,8,6]
</code></pre>
Example 2:
<pre><code class="lang-java">Input: nums = [-1,1,0,-3,3]
Output: [0,0,9,0,0]
</code></pre>
Here is the link to my solution:
<a target="_blank" href="https://github.com/divinebootable/CompareBinanryTrees/blob/master/src/comparebinanrytrees/CompareBinanryTrees.java">https://github.com/divinebootable/CompareBinanryTrees/blob/master/src/comparebinanrytrees/CompareBinanryTrees.java</a>

Given an integer array `nums`, return *an array* `answer` *such that* `answer[i]` *is equal to the product of all the elements of* `nums` *except* `nums[i]`.

The product of any prefix or suffix of `nums` is **guaranteed** to fit in a **32-bit** integer.

You must write an algorithm that runs in `O(n)` time and without using the division operation.

**Example 1:**

```java
Input: nums = [1,2,3,4]
Output: [24,12,8,6]
```

**Example 2:**

```java
Input: nums = [-1,1,0,-3,3]
Output: [0,0,9,0,0]
```

Here is the link to my solution:

[https://github.com/divinebootable/CompareBinanryTrees/blob/master/src/comparebinanrytrees/CompareBinanryTrees.java](https://github.com/divinebootable/CompareBinanryTrees/blob/master/src/comparebinanrytrees/CompareBinanryTrees.java)

Product of Array except self

Product of Array Except Self

Hello! I am Monyuy a software engineer. A day in my life consists of prepping web art, fixing front end bugs, adding API endpoint, database design and blogging.
