Leetcode Problem 2336. Smallest Number in Infinite Set

2336. Smallest Number in Infinite Set

Leetcode Solutions

Hashset + Heap Approach

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

Sorted Set Approach

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...