SearchingSorting-productArrayPuzzle.cpp

// 238. Product of Array Except Self
// time complexity O(n)
#include<bits/stdc++.h>
using namespace std;

void  ProductArray(vector<int>&nums){


           vector<int>left(nums.size());
        
        left[0]=1;
        
        for(int i=1;i<nums.size();i++){
            
            left[i]=left[i-1]*nums[i-1];
        }
        
        
        int right_remain=nums[nums.size()-1];
        
        
        for(int i=nums.size()-2;i>=0;i--){
            
            left[i]=left[i]*right_remain;
            
            right_remain=right_remain*nums[i];
        }
        
        
        
        for(auto it:left){
            cout<<it<<"\n";
        }
}

int main(){
    vector<int>nums={1,2,3,4};

    ProductArray(nums);
}