From df1c15de0564f81a3c08d686f86b903efb7887f1 Mon Sep 17 00:00:00 2001 From: Jorge Gonzalez Date: Wed, 18 Oct 2017 10:25:39 -0400 Subject: [PATCH] Add two-stack-queue problem (#57) --- algorithms/queue.md | 1 + 1 file changed, 1 insertion(+) diff --git a/algorithms/queue.md b/algorithms/queue.md index 7710f991..31612de9 100644 --- a/algorithms/queue.md +++ b/algorithms/queue.md @@ -2,3 +2,4 @@ Queue == - Implement a Queue class from scratch with an existing bug, the bug is that it cannot take more than 5 elements. +- Implement a Queue using two stacks. You may only use the standard `push()`, `pop()`, and `peek()` operations traditionally available to stacks. You do not need to implement the stack yourself (i.e. an array can be used to simulate a stack).