dashsaurabh

class Node {
    constructor(val){
        this.val = val;
        this.next = null
    }
}

class SinglyLinkedList{
    constructor(){
        this.length = 0;

dashsaurabh

class Node {
    constructor(val){
        this.val = val;
        this.next = null; 
    }
}

class Stack {
    constructor(){
        this.first = null;

dashsaurabh

class Node {
    constructor(val) {
        this.val = val;
        this.next = null
    }
}

class Queue {
    constructor(){
        this.first = null;

dashsaurabh

class Node {
    constructor(key, value) {
        this.key = key;
        this.value = value;
        this.next = null;
        this.prev = null;
    }
}

class LRUCache {

dashsaurabh

class MinBinaryHeap {
    constructor() {
        this.values = []
    }

    insert(val) {

        this.values.push(val)
        
        //first element in the heap

dashsaurabh

class Queue {
    constructor() {
        this.pushStack = new Stack();
        this.popStack = new Stack();
        this.size = 0;
    }

    enqueue(val) {
        this.pushStack.push(val);
        this.size = this.pushStack.length + this.popStack.length;

dashsaurabh

class Node {
    constructor(val){
        this.val = val;
        this.next = null
    }
}

class SinglyLinkedList{
    constructor(){
        this.length = 0;

dashsaurabh

class Node {
    constructor(val){
        this.val = val;
        this.next = null; 
    }
}

class ItemStack {
    constructor(){
        this.first = null;

dashsaurabh

class Node {
    constructor(val) {
        this.val = val;
        this.next = null;

    }
}

class Stack {
    constructor() {

dashsaurabh

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
var twoSum = function(nums, target) {
    
    let lookUp = {}
    
    for(let i = 0; i < nums.length; i++) {