From 046de15e59e1620bb166e4ffd8e9c53641f9acc4 Mon Sep 17 00:00:00 2001 From: Deven <63876261+devenperez@users.noreply.github.com> Date: Mon, 21 Oct 2024 09:13:23 -0400 Subject: [PATCH] Create README - LeetHub --- 0238-product-of-array-except-self/README.md | 25 +++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 0238-product-of-array-except-self/README.md diff --git a/0238-product-of-array-except-self/README.md b/0238-product-of-array-except-self/README.md new file mode 100644 index 0000000..699ca8d --- /dev/null +++ b/0238-product-of-array-except-self/README.md @@ -0,0 +1,25 @@ +

238. Product of Array Except Self

Medium

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:

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

Example 2:

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

 

+

Constraints:

+ + + +

 

+

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.)