maximum subarray whose sum equals 0

Question

An array contains both positive and negative elements, find the maximum subarray whose sum equals 0.

Answer 1

Hope this help you.

 private static void subArrayZeroSum(int array[] , int findSum){
    Map> map = new HashMap>();
    int sum = 0;
   for(int index = 0 ; index < array.length ; index ++){
       sum +=array[index];
       if(array[index] == findSum){
           System.out.println(" ["+index+"]");
       }
       if(sum == findSum && index > 0){
           System.out.println(" [ 0 , "+index+" ]");
       }
       if(map.containsKey(sum)){
           HashSet set = map.get(sum);
           if(set == null)
               set = new HashSet();

           set.add(index);
           map.put(sum, set);

           for(int val : set){

               if(val + 1 != index && (val + 1) < index){
                  System.out.println("["+(val + 1) +","+index+" ]");
               }
           }

        }else{
            HashSet set = map.get(sum);
               if(set == null)
                   set = new HashSet();
               set.add(index);
            map.put(sum, set);
        }
   }        
}