This repository holds solution of problems asked in java interview under data-structure and algorithm.
- Implementing undo in an application.
- Implementing the back button in web browser.
- Holding memory for recursion calls in a programming language.
- Translating infix notation for expressions to postfix.
- match paranthesis to check a well formed expression.
- Find the minimum element in a stack in constant time. (use two stacks on every element push, push mimimum in second stack.)