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

Birthday Chocolate

  • DaniRed_ + 1 comment

    That't beutiful thank you for sharing : i did this way but we can make way shorter by yours..

    1. num=0
    2. for i in range(len(s)):
    3. if sum(s[i:i+m])==d:
    4. num+=1
    5. return(num)
    • DaniRed_ + 1 comment

      List comprehension is amazing

      • arshiyasoleimani + 0 comments

        I agree but also his method is n * m time complexity sadly.