algorithm/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2025-07-30 05:34:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update stack.md (#58)

Browse Source 
* Update stack.md

* Update stack.md
This commit is contained in:
rishabhjain1996
2017-10-18 20:56:24 +05:30
committed by Yangshun Tay
parent df1c15de05
commit 5d9002d786
1 changed files with 1 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
algorithms/stack.md
View File

@ -6,3 +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 an additional stack.