Fizz

README.md

@@ -0,0 +1,5 @@
+# AlgoCasts Practice Round 3
+
+Companion repo to a course on Udemy.com
+
+testing

altlinkedlist.js

@@ -0,0 +1,91 @@
+// Create the below linked list:
+// myLinkedList = {
+//   head: {
+//     value: 10
+//     next: {
+//       value: 5
+//       next: {
+//         value: 16
+//         next: null
+//       }
+//     }
+//   }
+// };
+
+class LinkedList {
+  constructor(value) {
+    this.head = {
+      value: value,
+      next: null
+    };
+    this.tail = this.head;
+    this.length = 1;
+  }
+  //add to back
+  //O(1) time
+  append(value) {
+    let node = { value: value, next: null };
+    this.tail.next = node;
+    this.tail = node;
+    this.length++;
+  }
+
+  //add to front
+  //O(1) time
+  prepend(value) {
+    let node = { value: value, next: null };
+    node.next = this.head;
+    this.head = node;
+    this.length++;
+  }
+
+  insert(value, index) {
+    let node = { value: value, next: null };
+    let previous = this.head;
+    let current = this.head.next;
+    let counter = 1;
+    while (counter < index && current !== null) {
+      counter++;
+      current = current.next;
+      previous = previous.next;
+    }
+    node.next = current;
+    previous.next = node;
+    this.length++;
+  }
+
+  printList() {
+    let current = this.head;
+    while (current) {
+      console.log(current);
+      console.log();
+      current = current.next;
+    }
+  }
+
+  remove(index) {
+    if (index === 0) {
+      this.head = this.head.next;
+      return;
+    }
+
+    let counter = 1;
+    let current = this.head.next;
+    let previous = this.head;
+    while (counter < index) {
+      counter++;
+      current = current.next;
+      previous = previous.next;
+    }
+    previous.next = current.next;
+    this.length--;
+  }
+}
+
+let myLinkedList = new LinkedList(10);
+myLinkedList.prepend(5);
+myLinkedList.prepend(16);
+myLinkedList.insert(99, 2);
+myLinkedList.remove(2);
+console.log(myLinkedList);
+console.log(myLinkedList.printList());

blog.js

@@ -0,0 +1,26 @@
+function plusFive(num) {
+  return num + 5;
+}
+
+//console.log(plusFive(3));
+//always returns 8 when 3 is argument
+
+//console.log(plusFive(5));
+//always returns 10 when 5 is argument
+
+student = {
+  firstName: "Johnny",
+  lastName: "Appleseed",
+  grade: 2,
+  age: 9
+};
+
+function moveUpGrade(student) {
+  return { ...student, grade: student.grade + 1 };
+}
+
+console.log(moveUpGrade(student));
+//{ firstName: 'Johnny', lastName: 'Appleseed', grade: 3, age: 9 }
+
+console.log(student);
+//{ firstName: 'Johnny', lastName: 'Appleseed', grade: 2, age: 9 }

completed_exercises/anagrams/index.js

@@ -0,0 +1,51 @@
+// --- Directions
+// Check to see if two provided strings are anagrams of eachother.
+// One string is an anagram of another if it uses the same characters
+// in the same quantity. Only consider characters, not spaces
+// or punctuation.  Consider capital letters to be the same as lower case
+// --- Examples
+//   anagrams('rail safety', 'fairy tales') --> True
+//   anagrams('RAIL! SAFETY!', 'fairy tales') --> True
+//   anagrams('Hi there', 'Bye there') --> False
+
+function anagrams(stringA, stringB) {
+  return cleanString(stringA) === cleanString(stringB);
+}
+
+function cleanString(str) {
+  return str
+    .replace(/[^\w]/g, '')
+    .toLowerCase()
+    .split('')
+    .sort()
+    .join('');
+}
+
+module.exports = anagrams;
+
+// function anagrams(stringA, stringB) {
+//   const aCharMap = buildCharMap(stringA);
+//   const bCharMap = buildCharMap(stringB);
+//
+//   if (Object.keys(aCharMap).length !== Object.keys(bCharMap).length) {
+//     return false;
+//   }
+//
+//   for (let char in aCharMap) {
+//     if (aCharMap[char] !== bCharMap[char]) {
+//       return false;
+//     }
+//   }
+//
+//   return true;
+// }
+//
+// function buildCharMap(str) {
+//   const charMap = {};
+//
+//   for (let char of str.replace(/[^\w]/g, '').toLowerCase()) {
+//     charMap[char] = charMap[char] + 1 || 1;
+//   }
+//
+//   return charMap;
+// }