[Prefix Sum] Product of Array Except Self

[sudosf]

Problem

Given an integer array, return an array where each element is the product of all other elements. Must run in O(n) without using the division operator.

References

• LeetCode: https://leetcode.com/problems/product-of-array-except-self/description/
• GFG: https://www.geeksforgeeks.org/problems/product-array-puzzle4525/1
• Sheet: https://www.risingbrain.org/sheet#array (Prefix Sum [Two Pointer] Move Zeroes #4)
• Parent: Pattern: Prefix Sum (Arrays) #51

Difficulty

🟡 Medium

Companies

Amazon, Facebook, Flipkart

Notes

Language: Java
Left prefix products pass, then right suffix products pass. No division needed.