LeetCode 75 C++ | Step-by-Step Solutions (LAN Academy) - LeetCode 2336 – Smallest Number in Infinite Set | C++ Min-Heap

In this video we solve LeetCode 2336: “Smallest Number in Infinite Set” using C++ and a clean min-heap + pointer design. We start from the idea that the set initially contains all positive integers [1, 2, 3, 4, ...], and we need to: • popSmallest(): remove and return the smallest number • addBack(num): add a number back, if it was removed before Key ideas in the solution: • Use a pointer (nextSmallest) that moves forward: 1, 2, 3, ... • Use a min-heap (priority_queue / set) to store numbers that were removed and then added back • Avoid duplicates in the heap with an extra boolean/array/set • Always take the minimum between the heap top and the current pointer You will learn: • How to design data structures for “infinite” sets • When to combine a pointer with a min-heap • Full C++ implementation, step by step • Time and space complexity analysis 🔗 Problem link: https://leetcode.com/problems/smallest-number-in-infinite-set/ 📚 Watch the full LeetCode playlist (C++ explanations + animations): https://www.youtube.com/playlist?list=PLF0G-7pZcOza_jyAxwMpa5KnK3vST5smK ––––– 💻 Technologies used • Language: C++ • Topic: Data structure design, heap, priority queue • Difficulty: Medium • Use case: Interview prep, LeetCode practice ––––– If this video helped you: 👍 Like the video 📝 Comment which design problem you want next ✅ Subscribe for more C++ + algorithms explanations #leetcode #leetcode2336 #cpp #heap #priorityqueue #datastructures #codinginterview @reper #foryou #viral #reper #urmaritori #for