C++ Coding Interviews (Queues and Stacks #3): Designing a Min Stack with Constant Time Operations

Join this channel to get access to perks: https://www.youtube.com/channel/UCGPoHTVjMN77wcGknXPHl1Q/join Join this channel for extra perks: 👉 [https://www.youtube.com/channel/UCGPoHTVjMN77wcGknXPHl1Q/join](https://www.youtube.com/channel/UCGPoHTVjMN77wcGknXPHl1Q/join) These videos share **my personal notes, thoughts, and attempts** at solving coding interview–style challenges, many of them inspired by (and sometimes directly from) Harry He’s book *Coding Interviews*. ⚠️ **Note:** These are **not official solutions** — they’re simply my own approaches while learning. I encourage you to try solving the problems yourself, too! Some problems shown here are **not in the book**, but I included them because they felt relevant to the same topic areas. 📖 If you’d like to check out the book, here’s the Amazon link: [https://amzn.to/43AFzBh](https://amzn.to/43AFzBh) 🔗 Current problem code: [https://github.com/djeada/Coding-Interviews/blob/master/src/3_Stack_Queue/min_in_stack.cpp](https://github.com/djeada/Coding-Interviews/blob/master/src/3_Stack_Queue/min_in_stack.cpp) 📝 My blog: [adamdjellouli.com](https://adamdjellouli.com)