238. Product of Array Except Self - LeetCode Solution

class Solution:
    def productExceptSelf(self, nums: List[int]) -> List[int]:
        
        left = [1]* len(nums)

        right = [1] * len(nums)

        count = 1

        for i in range(len(nums)):

            left[i] = count
            count *= nums[i]

        count = 1

        for i in range(len(nums)-1, -1, -1):
            right[i] = count
            count *= nums[i]

        for i in range(len(nums)):
            left[i] *= right[i]

        return left