Leetcode Problem 2336. Smallest Number in Infinite Set

2336. Smallest Number in Infinite Set

Leetcode Solutions

Initialize currentInteger to 1, isPresent as a hash set, and addedIntegers as a min-heap.
For popSmallest(), check if addedIntegers is not empty and pop the smallest element from it, otherwise return currentInteger and increment it.
For addBack(num), add num to both isPresent and addedIntegers if num is less than currentInteger and not already present in isPresent.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen