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

  • Coder_AMiT + 1 comment

    One liner is always better, but i dont really like to compress the size, moreover this is more readable:

    def getWays(squares, d, m): 
    count = 0    
    for i in range(0,len(squares)+1-m):
        if sum(squares[i:i+m]) == d:
            count+=1
    return count
    • girishpillai + 1 comment

      why is the range subtracted from len()+1?

      • Coder_AMiT + 0 comments

        so that when the sliciing happens on list squares[i:i+m] , it does not go above the index limit. as you can see i am doing i+m , while i is going from 0, to len() In such case, you need to reduce the window. This is known as Sliding window algorithm.