Q-6 PepCoding | Count Of All Subarrays With Zero Sum

PHOTO EMBED

Mon Jan 23 2023 09:17:21 GMT+0000 (Coordinated Universal Time)

Saved by @Ayush_dabas07

import java.util.*;

public class Main {

	public static int solution(int[] arr) {
		HashMap<Integer ,Integer > map = new HashMap<>();
		
		map.put(0 , 1); 
		int count =0;
		int sum  =0 ;
		
		for(int i =0 ; i< arr.length ; i++){
		  sum += arr[i];
		  
		  if(map.containsKey(sum)){
		      count += map.get(sum);
		  }
		  
		  map.put(sum,map.getOrDefault(sum,0)+1);
		  
		}

		return count;
	}
	
	public static void main(String[] args) {
		Scanner scn = new Scanner(System.in);
		int n = scn.nextInt();
		int[] arr = new int[n];
		for (int i = 0; i < n; i++) {
			arr[i] = scn.nextInt();
		}
		System.out.println(solution(arr));

	}

}
content_copyCOPY

https://www.pepcoding.com/resources/data-structures-and-algorithms-in-java-levelup/hashmap-and-heaps/count-of-all-subarrays-with-zero-sum-official/ojquestion