We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Subarray Division
  5. Discussions

Subarray Division

  • aayuuhere
     + 0 comments

    Java Solution

    Using Sliding Window Protocal O(n)

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