Jamie Kelly j-quelly

## countClouds.js
function sweepClouds({ skyMap, y, x }) {
  if (!skyMap[y]) {
    return;
  }

  if (!skyMap[y][x]) {
    return;
  }

  if (skyMap[y][x] === '1') {

## linkedlist-queue.py
class Node:
    def __init__(self, value):
        self.value = value
        self.next = None


class Queue:

    def __init__(self):
        self.head = None

## queue.js
// files to queue
let filesToProcess = [
  'file1',
  'file2',
  'file3',
  'file4',
  'file5',
  'file6',
  'file7',
  'file8',

## isTreeSymmetric.js
function get(object, prop, notFound = undefined) {
  if (object) {
    if (prop in object) {
      return object[prop];
    }
  }
  return notFound;
}

function depthFirst(tree, order, isNotSymmetrical, callback) {

## swapLexOrder.js
function quickSort(nums) {
  // base case
  if (nums.length <= 1) {
    return nums;
  }

  // grab a pivot
  const pivot = nums.pop();

  // divide

## groupingDishes.js
function groupingDishes(dishes) {
  const ingredientMap = dishes.reduce((map, dish) => {
    dish.slice(1).forEach((ingredient) => {
      if (!map[ingredient]) {
        map[ingredient] = [dish[0]];
      } else {
        // if happens more than once it should be an ingredient
        map[ingredient].push(dish[0]);
      }
    });

## rearrangeLastN.js
// Definition for singly-linked list:
// function ListNode(x) {
//   this.value = x;
//   this.next = null;
// }
//
function getArryFromList(l) {
  let current = l;
  const results = [];
  while(current) {

## reverseNodesInKGroups.js
// Definition for singly-linked list:
// function ListNode(x) {
//   this.value = x;
//   this.next = null;
// }
//
function reverseNodesInKGroups(l, k) {
  let temp = k;
  let current = l;
  const results = [];

## mergeTwoLinkedLists.js
// Definition for singly-linked list:
// function ListNode(x) {
//   this.value = x;
//   this.next = null;
// }
//
function mergeTwoLinkedLists(l1, l2) {
  const list = [];
  let left = l1;
  let right = l2;

## addTwoHugeNumbers.js
// Definition for singly-linked list:
// function ListNode(x) {
//   this.value = x;
//   this.next = null;
// }
//

function getNumber(list) {
  let current = list;
  let num = [];
	function sweepClouds({ skyMap, y, x }) {
	if (!skyMap[y]) {
	return;
	}

	if (!skyMap[y][x]) {
	return;
	}

	if (skyMap[y][x] === '1') {
	class Node:
	def __init__(self, value):
	self.value = value
	self.next = None


	class Queue:

	def __init__(self):
	self.head = None
	// files to queue
	let filesToProcess = [
	'file1',
	'file2',
	'file3',
	'file4',
	'file5',
	'file6',
	'file7',
	'file8',
	function get(object, prop, notFound = undefined) {
	if (object) {
	if (prop in object) {
	return object[prop];
	}
	}
	return notFound;
	}

	function depthFirst(tree, order, isNotSymmetrical, callback) {
	function quickSort(nums) {
	// base case
	if (nums.length <= 1) {
	return nums;
	}

	// grab a pivot
	const pivot = nums.pop();

	// divide
	function groupingDishes(dishes) {
	const ingredientMap = dishes.reduce((map, dish) => {
	dish.slice(1).forEach((ingredient) => {
	if (!map[ingredient]) {
	map[ingredient] = [dish[0]];
	} else {
	// if happens more than once it should be an ingredient
	map[ingredient].push(dish[0]);
	}
	});
	// Definition for singly-linked list:
	// function ListNode(x) {
	// this.value = x;
	// this.next = null;
	// }
	//
	function getArryFromList(l) {
	let current = l;
	const results = [];
	while(current) {