LeetCode 238 Product of Array Except Self - Problem Statement

This is Product of Array Except Self from LeetCode. Given an array $nums$, return an array $answer$ where $answer[i]$ is the product of all elements except $nums[i]$. The twist: you can't use division, and you must solve it in $O(n)$ time.

Without division, you can't just compute the total product and divide. What do you do? Think: products to the left of each index and products to the right. Combining both gives the answer without division.