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

  • ajit607029
     + 0 comments

    Easy Solution in Java

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

}
}