Product of Array Except Self

Problem Statement
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 should not use division, and the solution must run in O(n) time. This is LeetCode problem 238, commonly asked in Amazon interviews with array and prefix sum tags.[1][2]

Examples

• Input: nums =[2][3][4][1] Output:[6][8] Explanation: answer = 1234 / 1 (but without division) = 24; answer = 13*4 = 12, etc.[3][1][2]
• Input: nums =[4][1][2][3] Output:
  Explanation: Zeros affect products on the right side.[1]
• Input: nums = [-1,1,0,-3,3]
  Output: [0,0,-9,27,0]
  Explanation: Handles negatives and zeros correctly.[4]
• Input: nums =[5][10][2][3][6] Output:[1]

Constraints

• 2 ≤ nums.length ≤ 10^5[2]
• -30 ≤ nums[i] ≤ 30[2]
• Results fit in 32-bit integers (no overflow specified, but typical for problem).[3]