Discussion on Subarray Division Challenge

8 years ago+ 2 comments

One liner is always better, but i dont really like to compress the size, moreover this is more readable:

def getWays(squares, d, m): 
    count = 0    
    for i in range(0,len(squares)+1-m):
        if sum(squares[i:i+m]) == d:
            count+=1
    return count

Cookie support is required to access HackerRank