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.
defsolve(n,s,d,m):if(n==1ands[0]==d):return1elif(n==1):return0count=0foriinrange(len(s)-1):if(sum(s[i:m+i])==d):count=count+1returncount# Complete this function
Cookie support is required to access HackerRank
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 →
why not O(n) like below