Largest Subarray with K sum

class Solution {
    int maxLen(int arr[]) {
        int i, j, k;
        int sum, c=0, maxi=0, n=arr.length;
        for(i=0;i<n;++i)
        {
            for(j=i;j<n;++j)
            {
                sum = 0;
                c = 0;
                for(k=i;k<=j;++k)
                {
                    sum += arr[k];
                }
                if(sum==0)
                {
                    c=j-i+1;
                    maxi = Math.max(maxi, c);
                }
            }
        }
        return maxi;
    }
}