<h1 id="the-description">The Description</h1>
<p>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].</p>
<p>The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.</p>
<p>You must write an algorithm that runs in O(n) time and without using the division operation.</p>
<h1 id="steps">Steps</h1>
<p><img src="https://i.imgur.com/Tbt5OES.png" alt="First">
<img src="https://i.imgur.com/WioHyPh.png" alt="Second">
<img src="https://i.imgur.com/k6TWzxu.png" alt="Third">
<img src="https://i.imgur.com/EdTO2yJ.png" alt="Fourth">
<img src="https://i.imgur.com/WU4Woxx.png" alt="Fifth">
<img src="https://i.imgur.com/A4Zug0T.png" alt="Left"></p>
<p><img src="https://i.imgur.com/hPJGztn.png" alt="First">
<img src="https://i.imgur.com/xcAwUtP.png" alt="Second">
<img src="https://i.imgur.com/6HKZxnx.png" alt="Third">
<img src="https://i.imgur.com/WglpNh0.png" alt="Fourth">
<img src="https://i.imgur.com/9QLKAXh.png" alt="Fifth">
<img src="https://i.imgur.com/iod4SN8.png" alt="Left"></p>
<h1 id="implementation">Implementation</h1>
<p><img src="https://i.imgur.com/G1rbqXt.png" alt="Impl"></p>


Learn how to solve the problem of product of array except self leetcode problem.

Product of Array Except Self

The Description

Steps

Implementation