🔥 Product of Array Except Self

Author: maddhruv

README.md

@@ -4,8 +4,9 @@ Solutions of LeetCode Blind 75 Problems in JavaScript
 
 :goal_net: [Curated List of Top 75 LeetCode Questions](https://www.teamblind.com/post/New-Year-Gift---Curated-List-of-Top-75-LeetCode-Questions-to-Save-Your-Time-OaM1orEU)
 
-| Problem                                                                 | Difficulty                                             | Tags                                    | LeetCode                                                                 |
-| ----------------------------------------------------------------------- | ------------------------------------------------------ | --------------------------------------- | ------------------------------------------------------------------------ |
-| [Two Sum](./two-sum.js)                                                 | <img src="https://img.shields.io/badge/-Easy-green" /> | `Array`, `Hash Table`                   | [:link:](https://leetcode.com/problems/two-sum/)                         |
-| [Best Time to Buy and Sell Stock](./best-time-to-buy-and-sell-stock.js) | <img src="https://img.shields.io/badge/-Easy-green" /> | `Array`, `Dynamic Programming`          | [:link:](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) |
-| [Contains Duplicate](./contains-duplicate.js)                           | <img src="https://img.shields.io/badge/-Easy-green" /> | `Array`, `Set`, `Sorting`, `Hash Table` | [:link:](https://leetcode.com/problems/contains-duplicate/)              |
+| Problem                                                                 | Difficulty                                                | Tags                                    | LeetCode                                                                 |
+| ----------------------------------------------------------------------- | --------------------------------------------------------- | --------------------------------------- | ------------------------------------------------------------------------ |
+| [Two Sum](./two-sum.js)                                                 | <img src="https://img.shields.io/badge/-Easy-green" />    | `Array`, `Hash Table`                   | [:link:](https://leetcode.com/problems/two-sum/)                         |
+| [Best Time to Buy and Sell Stock](./best-time-to-buy-and-sell-stock.js) | <img src="https://img.shields.io/badge/-Easy-green" />    | `Array`, `Dynamic Programming`          | [:link:](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) |
+| [Contains Duplicate](./contains-duplicate.js)                           | <img src="https://img.shields.io/badge/-Easy-green" />    | `Array`, `Set`, `Sorting`, `Hash Table` | [:link:](https://leetcode.com/problems/contains-duplicate/)              |
+| [Product of Array Except Self](./product-of-array-except-self.js)       | <img src="https://img.shields.io/badge/-Medium-orange" /> | `Array`                                 | [:link:](https://leetcode.com/problems/product-of-array-except-self/)    |

product-of-array-except-self.js

@@ -0,0 +1,17 @@
+const productExceptSelf = (nums) => {
+  const result = new Array(nums.length).fill(1);
+
+  let prefix = 1;
+  for (let i = 0; i < nums.length; i++) {
+    result[i] = prefix;
+    prefix *= nums[i];
+  }
+
+  let postfix = 1;
+  for (let i = nums.length - 1; i >= 0; i--) {
+    result[i] *= postfix;
+    postfix *= nums[i];
+  }
+
+  return result;
+};