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.
O(n):
function birthday(s, d, m) {
// Write your code here
let count = 0;
for (let i=0; i 0 ? s[i-1]: 0);
if (i == m -1 && s[i] == d) {
count += 1
}
if (i > m - 1 && s[i] - s[i-m] == d) {
count += 1
}
}
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
You are viewing a single comment's thread. Return to all comments →
O(n): function birthday(s, d, m) { // Write your code here let count = 0; for (let i=0; i 0 ? s[i-1]: 0); if (i == m -1 && s[i] == d) { count += 1 } if (i > m - 1 && s[i] - s[i-m] == d) { count += 1 } } return count; }