Product of Array Except Self | Leetcode Top interview 150

[@CodingWithAnurag-1086]

Solution code - class Solution {
public:
vector productExceptSelf(vector& nums) {
int n = nums.size();
int mul = 1;
vector prefix(n,0);
vector suffix(n,0);
prefix[0] = nums[0];
for (int i=1;i=0;i--) {
suffix[i] = suffix[i+1]*nums[i];
}
vector ans(n,0);
ans[0] = suffix[1];
ans[n-1] = prefix[n-2];
for (int i=1;i