Get Minimum Element from Stack | O(1) Time Complexity | Multiple Approaches
Stack is a LIFO Data Structure meaning Last In First Out.
The Last Element to get in is the first to get out.
But how can we get the minimum element from a Stack in O(1) time complexity?
There are multiple approaches we discuss in this video and finally arrive at the one that is best logically, time-wise and space-wise.
Link to the source code - https://gist.github.com/dashsaurabh/4...
#stacks #minstack #datastructures #algorithms
++++++++++++++++++++++++++++++++++++++++++++++++++++
My General Tech Blog : http://www.progressivecoder.com
My Web Dev Focused Blog : https://www.progressivewebninja.com
My Github URL : https://www.github.com/dashsaurabh
#stacks #datastructures #algorithms #
++++++++++++++++++++++++++++++++++++++++++++++++++++
Sound Courtesy - https://www.bensound.com/
