This a solution for the 'Subarray Division' challenge by Hackerrank, you can use it free

Subarray Division Hackerrank

function birthday(s, d, m) {
    // Write your code here
    //we have to travel the array searching for the requirements
    //EXAMPLE:
    //s= [2,2,2,1,3,1]
    //m = 2
    //p = 4
    //First: we travel the array searching i to i+m
    let founds = 0;
    let splicedArray;
    let sum;
    for(let i = 0; i<s.length; i++){
        //splice the array
        splicedArray = s.slice(i,(i+m));
        //If the sum of all the values in the splicedArray is equals to p, then 
        //add to counter
        
        sum = splicedArray.reduce((element1,element2)=>{
            return element1+element2;
        },0)
        //Compare if are equal
        if(sum==d){
            founds++
        }
    }
    return founds;
}