feat: Python solution for LeetCode 2336 #101

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Open

TheRootDaemon wants to merge 1 commit into walkccc:main from TheRootDaemon:leetcode-2336

TheRootDaemon commented Sep 17, 2025

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

Time Complexities:

Constructor: O(1)
popSmallest: O(log n)
addback: O(n + log n)

Space Complexity: O(|addback()|)


          feat: Python solution for LeetCode 2336

71d7792

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet