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.
int sum = 0;
int count = 0;
for (int i = 0; i < s.size()+1; i++) {
if ((m + i) > s.size()) { break; }
System.out.println(s.subList(i, m+i));
for (int num : s.subList(i, m+i)) {
sum += num;
}
if (sum == d) { count++; sum = 0;}
else { sum = 0; }
}
return count;
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Subarray Division 1
You are viewing a single comment's thread. Return to all comments →