Maximum product subarray|| #blind75leetcode - question6 #leetcode #codingchallenges #coding #viral

[AbdulRajak-xv]

Hi,
If it possible could u explain me
This is my solution am facing error
class Solution {
public int maxProduct(int[] nums) {
int n = nums.length;
int prefix = 1;
int sufix = 1;
int max = Integer.MIN_VALUE;

for(int i=0;i<nums.length;i++) {
if(nums[i]==0) {
prefix = 1;
} else
{
prefix = prefix * nums[i];
} if(nums[n-i-1]==0) {
sufix=1;
} else {
sufix = sufix * nums[n-i-1];
}
max = Math.max(Math.max(prefix, sufix), max);
} return max;

}
}