In computer science, a stack or LIFO (last in, first out) is an abstract data type that serves as a collection of elements, with two principal operations: push, which adds an element to the collection, and pop, which removes the last element that was added. -- Stack (abstract data type), Wikipedia

The goal of this exercise is to practice writing prototype methods. As a reminder of how we use prototypes, we've provided starter code including a constructor function and one completed prototype method. Your task will be to complete the remaining method.

1. Fork and clone this repository.
2. Change into the new directory.
3. Install dependencies.
4. Create a working branch, challenge.
5. Follow the remaining instructions.

Create a custom JavaScript object modeling a stack using a constructor function and a prototype. Starter code has been provided in lib/stack.js.

• You should be able to create a new stack with let stack = new Stack();.

• Your stack should have two methods, push and pop.

  • push adds a new value to the stack's storage.
  • pop removes the most recently added value from the stack's storage and returns it.

• You should not use Array.prototype.push() or Array.prototype.pop().

As you work, you may run grunt test to check your code against these requirements.

Change xit to it in spec/stack.spec.js to have grunt test check the bonuses.

let stack = new Stack(1, 2, 3);
stack.pop(); //=> 3

let stack = new Stack();
stack.push(1).push(2).push(3);
stack.pop(); //=> 3

Which parts of each method are side-effects, and which are the "main" effect?

1. All content is licensed under a CC­BY­NC­SA 4.0 license.
2. All software code is licensed under GNU GPLv3. For commercial use or alternative licensing, please contact [email protected].