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. Practice
  2. Algorithms
  3. Implementation
  4. Birthday Chocolate
  5. Discussions

Birthday Chocolate

  • bineykingsley36 + 1 comment

    I have implemented it in O(n).

    • kjkanishk211194 + 1 comment

      can you show your logic ???

      • 0_harshit_0 + 0 comments

        function birthday(s, d, m) {

            let reducer = (a, c) => a + c;
let count=0;
for(let i=0; i<s.length; i++){
    let temp = s.slice(i, m+i);
    if(temp.reduce(reducer) == d){
        count++;
    }
        }
        return count;

        in JS