Ayush Pandey solution
public int[] productExceptSelf(int[] nums) {
int l = 1;
int[] res = new int[nums.length];
res[0] = 1;
for(int i = 1 ;i< nums.length ;i++){
res[i] = res[i-1]* nums[i-1];
}
int right = 1;
for(int j = nums.length-1 ; j>=0;j--){
res[j] = right * res[j];
right *= nums[j];
//1 1 2 6
//
//24 12 8 6
}
return res;
}