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 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;
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 →
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;