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.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Subarray Division
  5. Discussions

Subarray Division

  • wmgarciaporcel
     + 0 comments

    Here is my solution, using JavaScript

    function birthday(s, d, m) {
    // Write your code here
    let count = 0;
    while (s.length >= m){
      let sum = 0;
      // sum terms
      for(let i=0; i<m; i++){
        sum += s[i];
    }
    if(sum===d) count++;    
    s.shift();
    } 
    return count;
}