count subarrays
import java.util.HashMap;
class Solution {
public static long findSubarray(long[] arr, int n) {
HashMap<Long, Integer> freq = new HashMap<>();
long sum = 0;
long count = 0;
freq.put(0L, 1);
for (int i = 0...
yesamitsingh.hashnode.dev1 min read