Skip to content

Conversation

TheRootDaemon
Copy link

I have added the python solution for the problem 2336. Smallest Number in Infinite Set

Time Complexities:

  1. Constructor: O(1)
  2. popSmallest: O(log n)
  3. addback: O(n + log n)

Space Complexity: O(|addback()|)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant