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 1
- Discussions
Subarray Division 1
Subarray Division 1
Sort by
recency
|
283 Discussions
|
Please Login in order to post a comment
int contador = 0; for(int x = 0; x < s.Count - m +1 ; x++) { int valor = 0; for(int y = x; y < x + m; y++ ) { valor += s[y]; }
if(valor == d) { contador ++; } } return contador;
Kotlin Solution
c++20
logic on python
Python solution: