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
|
2935 Discussions
|
Please Login in order to post a comment
Code in C++
int birthday(vector s, int d, int m) { int n = s.size(), sum = 0, count = 0 ; for ( int i = 0 ; i < n ; i++ ) { int j = i ; sum = 0 ; int k = m ;
while (k) { sum += s[j] ; j++, k-- ; } if ( sum == d ) { count += 1 ; } } return count ; }
GO
Python
In C++
PYTHON CODE: def birthday(s, d, m): count = 0 for idx in range(len(s) - m + 1): if sum(s[idx:idx + m]) == d: count += 1 return count