From 98c64ea66bd21cb6e6cd04b2c3f1b93ab4a855f4 Mon Sep 17 00:00:00 2001 From: rishabhjain1996 Date: Wed, 18 Oct 2017 20:54:02 +0530 Subject: [PATCH] Update stack.md --- algorithms/stack.md | 1 + 1 file changed, 1 insertion(+) diff --git a/algorithms/stack.md b/algorithms/stack.md index 627ee2c6..0d0a2e30 100644 --- a/algorithms/stack.md +++ b/algorithms/stack.md @@ -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 recursion/using an additional stack.