Update stack.md

pull/58/head
Yangshun Tay 8 years ago committed by GitHub
parent 98c64ea66b
commit 388dbc1121

@ -6,4 +6,4 @@ Stack
- Write an algorithm to determine if all of the delimiters in an expression are matched and closed.
- E.g. `{ac[bb]}`, `[dklf(df(kl))d]{}` and `{[[[]]]}` are matched. But `{3234[fd` and `{df][d}` are not.
- [Source](http://blog.gainlo.co/index.php/2016/09/30/uber-interview-question-delimiter-matching/)
- Sort a stack in ascending order using recursion/using an additional stack.
- Sort a stack in ascending order using an additional stack.

Loading…
Cancel
Save