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

  • LeHarkunwar + 2 comments

    Did similarly, but shorter

    def solve(n, s, d, m):
    return sum([1 for i in range(n-m+1) if sum(s[i:i+m]) == d])
    • victorz + 2 comments

      That's just a copy of https://www.hackerrank.com/challenges/the-birthday-bar/forum/comments/289156

      • LeHarkunwar + 0 comments

        Truly didn't see that, looks super similar :P

      • cfshao_bjtu + 1 comment

        I cannot see the results in the link. Could you please share your code here?

        Thank you

        • cfshao_bjtu + 0 comments

          @victorz

    • bL4ck_r4bb1t + 0 comments

      In Python True == 1 and False == 0, so this also works:

      def solve(n, s, d, m):
    return sum(sum(s[i: i + m]) == d for i in range(n - m + 1))