feat(ts): stack and queue implementation

contents/stacks_and_queues/code/typescript/queue.ts

@@ -0,0 +1,52 @@
+interface IQueue<T> {
+  /**
+   * `dequeue` removes first element from the queue and returns the same
+   */
+  dequeue(): T;
+  /**
+   * `enqueue` adds element to last of the queue and returns the size
+   */
+  enqueue(data: T): number;
+  /**
+   * `size` return size or length of the queue
+   */
+  size(): number;
+  /**
+   * `front` returns first element of the queue
+   */
+  front(): T;
+}
+
+class Queue<T> implements IQueue<T> {
+  private readonly list: Array<T> = [];
+
+  public enqueue(data: T) {
+    return this.list.push(data);
+  }
+
+  public dequeue() {
+    return this.list.shift();
+  }
+
+  public size() {
+    return this.list.length;
+  }
+
+  public front() {
+    return this.list[0];
+  }
+}
+
+function exampleQueue() {
+  const numberQueue = new Queue<number>();
+
+  numberQueue.enqueue(4);
+  numberQueue.enqueue(5);
+  numberQueue.enqueue(9);
+
+  console.log(numberQueue.dequeue());
+  console.log(numberQueue.size());
+  console.log(numberQueue.front());
+}
+
+exampleQueue();

contents/stacks_and_queues/code/typescript/stack.ts

@@ -0,0 +1,52 @@
+interface IStack<T> {
+  /**
+   * `pop` removes last element from the stack and returns the same
+   */
+  pop(): T;
+  /**
+   * `push` adds element to last of the stack and returns the size
+   */
+  push(data: T): number;
+  /**
+   * `size` return size or length of the stack
+   */
+  size(): number;
+  /**
+   * `top` returns last element of the stack
+   */
+  top(): T;
+}
+
+class Stack<T> implements IStack<T> {
+  private readonly list: Array<T> = [];
+
+  public push(data: T) {
+    return this.list.push(data);
+  }
+
+  public pop() {
+    return this.list.pop();
+  }
+
+  public size() {
+    return this.list.length;
+  }
+
+  public top() {
+    return this.list[this.list.length - 1];
+  }
+}
+
+function exampleStack() {
+  const numberStack = new Stack<number>();
+
+  numberStack.push(4);
+  numberStack.push(5);
+  numberStack.push(9);
+
+  console.log(numberStack.pop());
+  console.log(numberStack.size());
+  console.log(numberStack.top());
+}
+
+exampleStack();