Subarray Division 2

  • + 0 comments
    public static int birthday(List<Integer> s, int d, int m) {
    // Write your code here
        int segments = 0;
        int n = s.size();
        for(int i = 0; i <= n-m; i++){
            int sum =0;
            for(int j = 0; j < m ; j++){
                sum = sum + s.get(i + j);
            }
            if(sum == d){
                segments++;
            }
        }
        return segments;
    }