Attempt using slicing to achieve O(n) without division.

NeetCodeRoadmap/Arrays_and_Hashing/238_Product_of_Array_Except_Self.py

@@ -1,6 +1,15 @@
-def productExceptSelf(self, nums):
+def productExceptSelf(nums):
         """
         :type nums: List[int]
         :rtype: List[int]
         """
+        numsProduct = []
+        for x in range(len(nums)):
+                firstHalf = nums[:x]
+                secondHalf = nums[(len(nums)-x):]
+                if firstHalf:
+                        product = firstHalf + secondHalf
+                        numsProduct.append(product)
+        return numsProduct
 
+print(productExceptSelf([1,2,3,4]))