**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 of any prefix or suffix of `nums` is guaranteed to fit in a 32-bit integer.
**Hint / Expected Approach:**
Left-pass × right-pass without division
**Edge Cases to Consider:**
- (1) Array contains zeros (one vs two zeros)
- (2) Two-element array
- (3) All ones