Pinned

1. graphSearch.js graphSearch.js

   1

   /*  Graph Search Algoroithms

   2

   *  Here we would implement a graph in the form of an adjacency list

   3

   *  There are a few ways this can be done :

   4

   *  a.Adjacency Matrix: Represent each node in a 2D matrix, the edges represent relationships between nodes

   5

   *  b.Adjacency List: Start with a collection of nodes each having their array of edges, this is easier 0on memmory and faster

2. delayedShiftArray.ts delayedShiftArray.ts

   1

   // Implement a queue using Delayed shift arrays - It consists of associating an index with the array. 

   2

   // When an element is dequeued, the index moves forward. When the index reaches the middle of the array, 

   3

   // the array is sliced in two to remove the first half.

   4

   5

   // This is a FIFO data structure

3. This is a sample tic tac toe applica... This is a sample tic tac toe application. Based on a coderbyte test

   1

   import React, { useState, useEffect } from 'react';

   2

   import ReactDOM from 'react-dom';

   3

   4

   5

   const squareStyle = {

4. Elevator Engineering Test. Full test... Elevator Engineering Test. Full test description can be found here: https://docs.google.com/document/d/1Vx2iVzvoB_wQ-fG5RC-tQviseJvs-mzofL_rAaz4t_A/edit?usp=sharing

   1

   interface IElevator {

   2

     on: (events: string, callback: Function) => void;

   3

     getCurrentFloor: () => number;

   4

     getCurrentDirection: () => DIRECTIONS;

   5

     moveUp: () => void;