Alex Hladun alex-hladun

## pigLatin.js
const args = process.argv.slice(2);

let str = "";
for (let i = 0; i <= args.length - 1; i++) {
  let phrase = "";
  let firstLetter = "";
  for (let j = 0; j <= args[i].length - 1; j++) {
    if (j === 0) {
      firstLetter = args[i][0];
    } else {

## palindromeChecker.js
// FUNCTION IMPLEMENTATION (MULTIPLE BUGS)
const isPalindrome = function(str) {
  const noSpaces = str.split(" ").join("");
  console.log(noSpaces);
  const midIndex = Math.floor(noSpaces.length/2);
  const lastIndex = noSpaces.length - 1;

  for (let i = 0; i < midIndex; i++) {
    // console.log(str[i])
    // console.log(str[lastIndex - i])

## joinList
/*
 * Write a function that joins the contents of conceptList together
 * into one String, concepts, with each list item separated from
 * the previous by a comma.
 *
 * To implement this we'll create a joinList function which will take
 * in any array of strings return a comma-separated string.
*/

let joinList = function(list) {

## sales.js
const calculateSalesTax = function(salesData, taxRates) {
  const results = {};

  // Iterate through each company in the list
  for (let i = 0; i <= salesData.length - 1; i++) {

    // Initialize results object if it doesn't exist.
    if (!results[salesData[i]['name']]) {

      results[salesData[i]['name']] = { totalSales: 0, totalTaxes: 0 };

## social.js
const biggestFollower = function (data) {
  let bigFollow = { name: "", followCount: 0 }
  for (let id in data) {
    if (data[id]['follows'].length > bigFollow.followCount) {
      bigFollow.name = data[id]['name'];
      bigFollow.followCount = data[id]['follows'].length;
    }
  }

  console.log(`${bigFollow.name} follows the most people (${bigFollow.followCount}).`);

## advancedSortFunction.js
const students = [
  { id: 1, name: "bruce", age: 40 },
  { id: 2, name: "zoidberg", age: 22 },
  { id: 3, name: "alex", age: 22 },
  { id: 4, name: "alex", age: 30 }
];
const students2 = [
  { id: 1, name: "Frank", age: 100 },
  { id: 2, name: "Jay", age: 22 },
  { id: 3, name: "Frank", age: 22 },

## library.js
const library = {
  tracks: { t01: { id: "t01",
    name: "Code Monkey",
    artist: "Jonathan Coulton",
    album: "Thing a Week Three" },
  t02: { id: "t02",
    name: "Model View Controller",
    artist: "James Dempsey",
    album: "WWDC 2003"},
  t03: { id: "t03",

## recursionSum.js
const sum = function(fromN, toN) {
  if (fromN === toN) {
    return toN;
  } else {
    return fromN + sum(fromN + 1, toN);
  }
};

module.exports = sum;

## vampire.js
class Vampire {
  constructor(name, yearConverted) {
    this.name = name;
    this.yearConverted = yearConverted;
    this.offspring = [];
    this.creator = null;
  }

  /** Simple tree methods **/

## fractals.html
<!DOCTYPE HTML>
<html>
  <head>
    <style>
      body {
        margin: 0px;
        padding: 0px;
      }
    </style>
  </head>
	const args = process.argv.slice(2);

	let str = "";
	for (let i = 0; i <= args.length - 1; i++) {
	let phrase = "";
	let firstLetter = "";
	for (let j = 0; j <= args[i].length - 1; j++) {
	if (j === 0) {
	firstLetter = args[i][0];
	} else {
	// FUNCTION IMPLEMENTATION (MULTIPLE BUGS)
	const isPalindrome = function(str) {
	const noSpaces = str.split(" ").join("");
	console.log(noSpaces);
	const midIndex = Math.floor(noSpaces.length/2);
	const lastIndex = noSpaces.length - 1;

	for (let i = 0; i < midIndex; i++) {
	// console.log(str[i])
	// console.log(str[lastIndex - i])
	/*
	* Write a function that joins the contents of conceptList together
	* into one String, concepts, with each list item separated from
	* the previous by a comma.
	*
	* To implement this we'll create a joinList function which will take
	* in any array of strings return a comma-separated string.
	*/

	let joinList = function(list) {
	const calculateSalesTax = function(salesData, taxRates) {
	const results = {};

	// Iterate through each company in the list
	for (let i = 0; i <= salesData.length - 1; i++) {

	// Initialize results object if it doesn't exist.
	if (!results[salesData[i]['name']]) {

	results[salesData[i]['name']] = { totalSales: 0, totalTaxes: 0 };
	const biggestFollower = function (data) {
	let bigFollow = { name: "", followCount: 0 }
	for (let id in data) {
	if (data[id]['follows'].length > bigFollow.followCount) {
	bigFollow.name = data[id]['name'];
	bigFollow.followCount = data[id]['follows'].length;
	}
	}

	console.log(`${bigFollow.name} follows the most people (${bigFollow.followCount}).`);
	const students = [
	{ id: 1, name: "bruce", age: 40 },
	{ id: 2, name: "zoidberg", age: 22 },
	{ id: 3, name: "alex", age: 22 },
	{ id: 4, name: "alex", age: 30 }
	];
	const students2 = [
	{ id: 1, name: "Frank", age: 100 },
	{ id: 2, name: "Jay", age: 22 },
	{ id: 3, name: "Frank", age: 22 },
	const library = {
	tracks: { t01: { id: "t01",
	name: "Code Monkey",
	artist: "Jonathan Coulton",
	album: "Thing a Week Three" },
	t02: { id: "t02",
	name: "Model View Controller",
	artist: "James Dempsey",
	album: "WWDC 2003"},
	t03: { id: "t03",
	const sum = function(fromN, toN) {
	if (fromN === toN) {
	return toN;
	} else {
	return fromN + sum(fromN + 1, toN);
	}
	};

	module.exports = sum;
	class Vampire {
	constructor(name, yearConverted) {
	this.name = name;
	this.yearConverted = yearConverted;
	this.offspring = [];
	this.creator = null;
	}

	/ Simple tree methods /
	<!DOCTYPE HTML>
	<html>
	<head>
	<style>
	body {
	margin: 0px;
	padding: 0px;
	}
	</style>
	</head>