You are viewing a single comment's thread. Return to all comments →
Beat this:
def getWays(squares, d, m): return sum([1 for i in range(n-m+1) if sum(s[i:i+m])==d])
Seems like cookies are disabled on this browser, please enable them to open this website
Subarray Division
You are viewing a single comment's thread. Return to all comments →
Beat this: