Add solution #232

Author: JoshCrozier

README.md

@@ -55,6 +55,7 @@
 219|[Contains Duplicate II](./0219-contains-duplicate-ii.js)|Easy|
 225|[Implement Stack using Queues](./0225-implement-stack-using-queues.js)|Easy|
 226|[Invert Binary Tree](./0226-invert-binary-tree.js)|Easy|
+232|[Implement Queue using Stacks](./0232-implement-queue-using-stacks.js)|Easy|
 234|[Palindrome Linked List](./0234-palindrome-linked-list.js)|Easy|
 237|[Delete Node in a Linked List](./0237-delete-node-in-a-linked-list.js)|Easy|
 242|[Valid Anagram](./0242-valid-anagram.js)|Easy|

solutions/0232-implement-queue-using-stacks.js

@@ -0,0 +1,58 @@
+/**
+ * 232. Implement Queue using Stacks
+ * https://leetcode.com/problems/implement-queue-using-stacks/
+ * Difficulty: Easy
+ *
+ * Implement a first in first out (FIFO) queue using only two stacks.
+ * The implemented queue should support all the functions of a normal
+ * queue (push, peek, pop, and empty).
+ *
+ * Implement the MyQueue class:
+ * - void push(int x) Pushes element x to the back of the queue.
+ * - int pop() Removes the element from the front of the queue and returns it.
+ * - int peek() Returns the element at the front of the queue.
+ * - boolean empty() Returns true if the queue is empty, false otherwise.
+ */
+
+
+var MyQueue = function() {
+  this.data = [];
+};
+
+/**
+ * @param {number} x
+ * @return {void}
+ */
+MyQueue.prototype.push = function(x) {
+  this.data.push(x);
+};
+
+/**
+ * @return {number}
+ */
+MyQueue.prototype.pop = function() {
+  return this.data.shift();
+};
+
+/**
+ * @return {number}
+ */
+MyQueue.prototype.peek = function() {
+  return this.data[0];
+};
+
+/**
+ * @return {boolean}
+ */
+MyQueue.prototype.empty = function() {
+  return !this.data.length;
+};
+
+/**
+ * Your MyQueue object will be instantiated and called as such:
+ * var obj = new MyQueue()
+ * obj.push(x)
+ * var param_2 = obj.pop()
+ * var param_3 = obj.peek()
+ * var param_4 = obj.empty()
+ */