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

  • marinskiy + 4 comments

    Here is Python 3 solution from my HackerrankPractice repository:

    n, s = int(input().strip()), list(map(int, input().split()))
d, m = map(int, input().split())
print(sum([sum(s[i : i + m]) == d for i in range(len(s) - m + 1)]))

    Feel free to ask if you have any questions :)

    • thilak412 + 0 comments

      can you explain that please :-(

    • chauhanshivam_ + 0 comments

      This is what i was looking for! thanks!

    • vamsikrish04 + 0 comments
      [deleted]
    • pWiszniewski + 0 comments

      It's O(n*m), can be done faster with O(n). One-liner doesn't make it good solution.