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

  • bineykingsley36 + 1 comment

    nice logic. However can you reduce the time complexity a little?

    • victorz + 0 comments

      No, it's already O(n).