verdi327

var solveSudoku = function(board, row=0, col=0) {
  function isSafe(row, col, num) {
    return isRowSafe(row, num) && isColSafe(col, num) && isGridSafe(row, col, num);
  }

  function isRowSafe(row, num) {
    for (let col=0; col<board.length;col++) {
      if (board[row][col] === num) return false;
    }
    return true;

verdi327

function findBestStartingSpot(matrix) {
  let bestStartingSpot = [];
  let min = Infinity;

  function validMove(row, col, matrixDup) {
    return  row >= 0 &&
            row < matrixDup.length &&
            col >= 0 &&
            col < matrixDup[0].length &&
            matrixDup[row][col] !== '*';

verdi327

class Hotel {
  constructor(numRooms) {
    this.totalRooms = numRooms;
    this.reservations = {};
  }

  book(startDay, endDay) {
    let checkIn = this._keyify(startDay);
    // do we have any reservations at this date
    if (this.reservations[checkIn] && this.reservations[checkIn].length) {

verdi327

function stringify(input) {
  if (!input) return "null";
  if (typeof(input) === 'string') return input;
  if (typeof(input) === 'number') return `"${input}"`;
  if (Array.isArray(input)) {
    let result = [];
    input.forEach(value => {
      result.push(stringify(value));
    });
    return `[${result}]`;

verdi327

class GraphNode {
  constructor(label) {
    this.label = label;
    this.neighbors = new Set();
    this.color = null;
  }
}

const nodeA = new GraphNode('A');
const nodeB = new GraphNode('B');

verdi327

function binarySearch(sortedArray, searchValue, minIndex=0, maxIndex=sortedArray.length-1) {
  let currentElement, middleIndex;

  while (minIndex <= maxIndex) {
    // Find the value of the middle of the array
    middleIndex = Math.floor((minIndex + maxIndex) / 2);
    currentElement = sortedArray[middleIndex];
      
    // It's the same as the value in the middle - we can return!
    if (currentElement === searchValue) {

verdi327

postOrder(result=[]) {
  if (!this.left && !this.right) {
    return result.push(this.key);
  }

  if (this.left) {
    this.left.postOrder(result);
  }
  if (this.right) {
    this.right.postOrder(result);

verdi327

inOrder(result=[]) {
  if (!this.left && !this.right) {
    return result.push(this.key);
  }
  if (this.left) {
    this.left.inOrder(result);
  }
  result.push(this.key);
  if (this.right) {
    this.right.inOrder(result);

verdi327

  preOrder(result=[]) {
    if (!this.left && !this.right) {
      return result.push(this.key);
    }
    result.push(this.key);
    if (this.left) {
      this.left.preOrder(result);
    }
    if (this.right) {
      this.right.preOrder(result);

verdi327

  bfs(result=[]) {
    const queue = new Queue();
    queue.enqueue(this);
    let node;
    
    while (queue.length) {
      node = queue.dequeue();
      result.push(node.key);

      if (node.left) {