subarray division hackerrank solution javascript
// subarray division hackerrank solution javascript
function birthday(s, d, m) {
// Write your code here
let count = 0;
let sum = 0;
for(let i=0 ; i<s.length; i++){
sum = s.slice(i, m + i).reduce((previous,current) => previous + current);
if(sum === d){
count++
}
}
return count;
}subarray division hackerrank solution
class Result
{
public static int birthday(List<int> s, int d, int m)
{
int count=0;
for(var i=0; i<s.Count; i++)
{
var temp =SegmentSum(s, i, m);
if(temp==d)
count++;
}
return count;
}
public static int SegmentSum(List<int> s, int index, int room)
{
var sum =0;
var iterUpto = index + room;
for(var i=index; i<iterUpto; i++ )
{
if(i>=s.Count)
break;
sum+=s[i];
}
return sum;
}
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
