naveenrawat51

+++++++++++++++++ call() Implementation +++++++++++++++++++++
  
  Function.prototype.myCall = function(obj1){
 let random = Math.random();
  obj1[random] = this;
  
  let args = [];
  
  for( let i =1; i<arguments.length; i++ ){
    args.push(arguments[i])

naveenrawat51

Call(), apply() and Bind() Implementation:

// Bind implementation
Function.prototype.myBind = function(...args) {
  let obj = this;
  let params = args.slice(1);
  return function(...args2) {
    
    return obj.apply(args[0], [...params, ...args2]);
  }

naveenrawat51

let flattenObj = function(inputObject) {
  let flattenedObj = {};
  
  for (let obj in inputObject) {
    if (inputObject[obj].constructor === Object) {
      let flatObj = flattenObj(inputObject[obj]);
      
      for(let i in flatObj) {
        flattenedObj[i] = flatObj[i];
      }

naveenrawat51

class Node {
            constructor(value) {
                this.value = value;
                this.right = null;
                this.left = null;
            }
        }
        
        class BinarySearchTree {
            constructor() {

naveenrawat51

class Myarray {
    constructor(size) {
        (this.data = {}), (this.length = 0);

        for (let i = 0; i < size; i++) {
            this.data[i] = undefined;
            this.length++;
        }
    }

naveenrawat51

class HashTable {
    constructor(size) {
        this.data = new Array(size);
    }

    // hash method
    hashKey(key) {
        let hash = 0;
        for (let i = 0; i < key.length; i++) {
            hash = (hash + key.charCodeAt(i) * i) % this.data.length;

naveenrawat51

// new node structure
class Node {
    constructor(value) {
        this.value = value;
        this.next = null;
    }
}

// linkedlist implementation
class LinkedList {

naveenrawat51

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

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

naveenrawat51

class Mystack {
    constructor() {
        this.count = 0;
        this.data = [];
    }

    push(item) {
        this.data[this.count] = item;
        this.count += 1;
        return this.data;

naveenrawat51

// Since ES6 Map()'s' retain their order of insertion, it can sometimes be useful to get the last item or value inserted:

export const getLastItemInMap = map => Array.from(map)[map.size-1]
export const getLastKeyInMap = map => Array.from(map)[map.size-1][0]
export const getLastValueInMap = map => Array.from(map)[map.size-1][1]

// Obviously getLastKey and getLastValue can reuse getLastItem, but for maximum portability I opted for verbosity.