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.
Subarray Division
Subarray Division
Sort by
recency
|
3092 Discussions
|
Please Login in order to post a comment
Java Solution
Using Sliding Window Protocal O(n)
TypeScript ugly one-liner:
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; }
Here is my solution, using JavaScript