15% off all plans & roadmaps Use code
See plans
Preparing this workspace.
LeetCode 2336 · Solution & editorial
You have a set which contains all positive integers [1, 2, 3, 4, 5, ...].
Smallest Number in Infinite Set is a Design Patterns problem, in the Design (General/Specific) subpattern. The pattern covers tries, LRU/LFU cache, and data structure design
Design and implement data structures: LRU cache, LFU cache, HashMap, and specialized structures.
The reference solution runs in O(log n) time and O(k) space.
The full editorial is part of Pro
It explains the core insight, the complexity analysis and the common mistakes, with a worked solution.
Smallest Number in Infinite Set is a Design Patterns problem, in the Design (General/Specific) subpattern. Once the approach above makes sense, write it yourself and then work through the neighbouring problems that reuse it.