Implement LC 238 Move Zeros and update README

Author: timothyshores

238. Product of Array Except Self.js

@@ -25,3 +25,44 @@ The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit int
 Follow up: Can you solve the problem in O(1) extra space complexity? (The output array does not count as extra space for space complexity analysis.)
 
 */
+
+const getPrefixProduct = (arr) => {
+  const n = arr.length;
+  const result = new Array(n);
+  result[0] = arr[0];
+
+  for (let i = 1; i < n; i++) {
+    result[i] = result[i - 1] * arr[i]
+  }
+
+  return result;
+};
+
+const getSuffixProduct = (arr) => {
+  const n = arr.length;
+  const result = new Array(n); // Preallocate the array with the required length
+  result[n - 1] = arr[n - 1]; // Initialize the last element
+
+  for (let i = n - 2; i >= 0; i--) {
+    result[i] = result[i + 1] * arr[i];
+  }
+
+  return result;
+};
+
+/**
+ * @param {number[]} nums
+ * @return {number[]}
+ */
+const productExceptSelf = (nums) => {
+  const prefixProduct = getPrefixProduct(nums);
+  const suffixProduct = getSuffixProduct(nums);
+
+  const result = [];
+
+  for (const num of nums) {
+    result.push(); // TODO calculate current element
+  }
+
+  return result;
+};

README.md

@@ -28,6 +28,7 @@ LeetCode Profile: https://leetcode.com/timothyshores/
 |[187. Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/)|Medium|[JavaScript](187.%20Repeated%20DNA%20Sequences.js)
 |[217. Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)|Easy|[JavaScript](217.%20Contains%20Duplicate.js)
 |[232. Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/)|Easy|[JavaScript](232.%20Implement%20Queue%20using%20Stacks.js)
+|[238. Product of Array Except Self](https://leetcode.com/problems/move-zeroes/description/)|Easy|[JavaScript](238.%20Product%20of%20Array%20Except%20Self.js)
 |[242. Valid Anagram](https://leetcode.com/problems/valid-anagram/)|Easy|[JavaScript](242.%20Valid%20Anagram.js)
 |[278. First Bad Version](https://leetcode.com/problems/first-bad-version/)|Easy|[JavaScript](278.%20First%20Bad%20Version.js)
 |[283. Move Zeroes](https://leetcode.com/problems/move-zeroes/)|Easy|[JavaScript](283.%20Move%20Zeroes.js)