You are viewing a single comment's thread. Return to all comments →
Pyhton people see this!!
def getWays(squares, d, m): tp = (len(squares)-m) + 1 #total number of pieces possible return len([1 for i in range(tp) if sum(squares[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 →
Pyhton people see this!!