[Leetcode] Min Stack
Use more space to improve time complexity.
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
Backtracking is used in specific cases of DFS. Global variable / parameter may be modified across different level of search. However, when search returns, the variable / parameter needs to be at original state for the new search, where backtracking should occur.