* Patch - 1

* Updating the code to rectify the result to show the correct order of expected result

* Updating the results w.r.t code changes

The original implementation did not answer the question in the book.

closes careercup#58

* chore: rewrite queue to es6

* fix(2.1): redo with proper linked list

redid 2.1 using a properly defined linked list

This commit fixes the implementations for stacks,
linked lists (singly) and queues, across
Chapter 2, 3, 4 and 7.

Maintains the previous interface for b/c.

- insertAt(index, value)
- removeAt(index)

* chore: rewrite 3.3 in ES6

* fix(3.3): bug fix for pop

- this clears an empty stack after a pop, instead
of checking in the next pop

* fix(3.3): fix popAt bug

- so as to handle exhausting popAt's

* fix(3.3): implement with stack adt

* Update isUnique.js

Using an object to store the occurrences, and check for duplication

* Update isUnique.js

* tripleStep Backtracking, Top Down and Bottom up memoization implementation

* removed comments

* removed more comments

* 8.01 tripleStep O(1) or constant space

* removed multi-line comment

* less bloating code for triple step

* constant space solution

* tripleStep version 2

* original and tripleStepv2

* formatted code

* added TEST comment

* added whitespace so both origin files are the same

Line no 47

It could be a typo but wrong solution.