GreggSetzer

/*
 A simple iterative solution to building steps.
 Uses String.prototype.repeat which is an ES2015 feature.
*/
function steps(n) {
  for (let i = 1; i <= n; i++) {
    let step = '#'.repeat(i) + ' '.repeat(n - i);
    console.log(step);
  }
}

GreggSetzer

/*
  Create a function to return the total number of vowels in a string.
  
  Use String.prototype.match() to find matches
  using a regular expression. 
  
  /[aeiou]/gi
  
  //    denotes a regex pattern.
  []    instructs match() to find any of these characters.

GreggSetzer

/*
  Check to see if two strings are anagrams, where both strings have the same characters in the same quantity.
  Only consider characters, not spaces and punctuation. Consider the strings as case insensitive, where capital 
  letters are the same as lowercase letters.
*/

function anagram(str1, str2) {
  //Step 1: Create a data store for each string.
  const charMap1 = getCharMap(str1);
  const charMap2 = getCharMap(str2);

GreggSetzer

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

GreggSetzer

/*
This function builds a pyramid using ES6 repeat function available on the String prototype.
https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/repeat

colSize: is the width of the grid in columns. Also think of it as the width of the last row in the pyramid.
level: This represents the width of the pyramid level at each iteration.
numSpaces: This represents the number of spaces to use on both sides of the pyramid.
spaces: This variable is used to cache the result of String#repeat(), no need to do the same work twice.
*/

GreggSetzer

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

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

/* 
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

/*
Draw a spiral matrix.

[ 1,  2,  3, 4]
[12, 13, 14, 5]
[11, 16, 15, 6]
[10,  9,  8, 7]

1. Initialize the multidimensional array.
2. Create counter variables to track positions.