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

  • johnmensah + 2 comments

    why not O(n) like below

    def solve(n, s, d, m):
    if(n==1 and s[0]==d):
        return 1
    elif(n==1):
        return 0
    count = 0
    for i in range(len(s)-1):
        if(sum(s[i:m+i])==d):
            count = count + 1
    return count
    # Complete this function
    • victorz + 1 comment

      -1 That's O(nm), not O(n).

      • smhoyo + 0 comments

        The reason is that your sum is an iterative function.

    • mahamadbilal696 + 1 comment

      we should select the proper range otherwise the list becomes out of order, but in this example no need(can select range(0, n))

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

      Any quasions, fell free to ask.

      • quaid_johar33 + 1 comment

        perfect code

        • arshiyasoleimani + 0 comments

          Very inefficent.