GreggSetzer

alias ip='ifconfig | grep "inet " | grep -v 127.0.0.1 | cut -d\  -f2'

GreggSetzer

class Node {
  constructor(data) {
    this.data = data;
    this.children = [];
  }
  
  add(data) {
    this.children.push(new Node(data));
  }
  

GreggSetzer

/* 
Return the largest value in an array of non-negative integers 
*/

function largestInt(arr) {
  if (arr.length === 0) {
    return -1;
  }
  
  return arr.reduce(comparator);

GreggSetzer

/*
Write a function that determines whether two integers are equal without using any comparison operators.

Use the bitwise XOR operator.
https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Bitwise_Operators#Bitwise_XOR

Using XOR, if any of the bits are different, a 1 is returned, otherwise, a 0 is returned.
*/
function isEqual(n1, n2) {
    return (n1 ^ n2) === 0;

GreggSetzer

/*
Linked List example.
*/

/**
 * Node class
 * Contains two properties and no methods.
 * data - The data to be stored in a single node.
 * next - The reference to the next node in the chain.
 */

GreggSetzer

/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
 * Create a Queue implementation using two stacks. Do not use an
 * array inside the Queue class. Queue should implement add() and
 * remove().
 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */

class Stack {
  constructor() {
    this.data = [];
  }

GreggSetzer

/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
 * Solve some arbitrary problem using a queue.
 * The interviewer has asked to provide a solution to a problem
 * using a Queue as the data structure. Using the native Array
 * in JavaScript with restricted access to its full list of methods
 * is one possible solution.
 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */

//Queues implement the FIFO method. First in, first out.
class Queue {

GreggSetzer

/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
 * Write a program to find a fibonacci number.
 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */

// * * * * * * * * * * * * * * * * * * * * * * * * * * *
// Iterative solution
// O(n) Linear Runtime Complexity
// This is an alternative approach to solving fibonacci 
// without recursion. However, this shoudn't be the 
// final answer in an interview setting.

GreggSetzer

/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
 * Given an array of orders, find the top 3 customers with the
 * highest lifetime value (those that spent the most over time).
 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */


// * * * * * * * * * * * * * * * * * * * * * * * * * * *
// Start with the initial implementation.
//
// One approach to solving this task would be to create

GreggSetzer

/*
Use the module pattern to group together similar methods such as database services. 
In the example below, the ItemDao (Data Access Object) simulates several functions
that interact with a database. 

1. Use modules to encapsulate related functionality.
2. A module pattern at its core is an object literal.
3. When using the module in code, call the functions using the key/value syntax. 
   For example: itemDao.findOne(1);
4. Wrap the object into a function to create a closure for private variables. Examples