ProductExceptSelfBruteforce.java

class Solution {
    public int[] productExceptSelf(int[] nums) {
        int n = nums.length;
        int[] ans = new int[n];
        for(int i = 0; i< n; i++) {
            int prod = 1;
            for(int j = 0; j<n; j++) {
                if(i==j) continue; // skipping in case if the indices are same
                prod *=nums[j];
            }
            ans[i] = prod;
        }
        return ans;
    }
}