Subarray Division 1

  • + 0 comments

    Java with Queue

    public static int birthday(List<Integer> s, int d, int m) {
        // Write your code here
        int count = 0;
        Queue<Integer> subarray = new LinkedList<>();
        
        for (int i = 0; i < s.size(); i++) {
            subarray.add(s.get(i));
            int currentSize = subarray.size();
            int sum = subarray.stream().mapToInt(Integer::intValue).sum();
            if (currentSize == m) {
                count = sum == d ? count + 1 : count;
                subarray.poll();
            } 
            
        }
        
        return count;
        }