Product of Array Except Self

        left[0] = nums[0];
        right[nums.size() - 1] = nums[nums.size() - 1];
        
        for(int i=1; i<nums.size(); i++){
            left[i] = left[i-1] * nums[i];
            right[nums.size() - 1 - i] = right[nums.size() - 1 - i + 1] * nums[nums.size() - 1 - i];
        }
        
        for(int i=0; i<nums.size(); i++){
            int left_product = 1;
            int right_product = 1;
            
            if(i != 0){
                left_product = left[i - 1];
            }
            
            
            if(i != nums.size() - 1){
                right_product = right[i + 1];
            }
            
            res[i] = left_product * right_product;
        }
        return res;
    }
};