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

  • ash_upadhyay
     + 10 comments
    def solve(n, s, d, m):
    # Complete this function
    count = 0
    for i in range(0,n):
        total = sum(s[i:m+i])
        if total == d:
            count+=1
    return count

    This function uses a sliding window too :) If any corrections please comment :)