JS II daily challenges completed

assignments/array-methods.js

@@ -56,21 +56,43 @@ const runners = [{"id":1,"first_name":"Charmain","last_name":"Seiler","email":"c
 // ==== Challenge 1: Use .forEach() ====
 // The event director needs both the first and last names of each runner for their running bibs.  Combine both the first and last names into a new array called fullName. 
 let fullName = [];
+
+runners.forEach(function(runner){
+    fullName.push(`${runner.first_name} ${runner.last_name}`);
+});
 console.log(fullName);
 
 // ==== Challenge 2: Use .map() ====
 // The event director needs to have all the runner's first names converted to uppercase because the director BECAME DRUNK WITH POWER. Convert each first name into all caps and log the result
 let allCaps = [];
+allCaps.push(runners.map(function(runner){
+    return runner.first_name.toUpperCase();
+}));
+
 console.log(allCaps); 
 
 // ==== Challenge 3: Use .filter() ====
 // The large shirts won't be available for the event due to an ordering issue.  Get a list of runners with large sized shirts so they can choose a different size. Return an array named largeShirts that contains information about the runners that have a shirt size of L and log the result
-let largeShirts = [];
+let largeShirts = runners.filter(function(runner) {
+    if (runner.shirt_size === 'L') {
+        return true;
+    } 
+});
+
 console.log(largeShirts);
 
+
+
 // ==== Challenge 4: Use .reduce() ====
 // The donations need to be tallied up and reported for tax purposes. Add up all the donations into a ticketPriceTotal array and log the result
 let ticketPriceTotal = [];
+ticketPriceTotal.push(
+    runners.reduce(function(acc, runner){
+        acc += runner.donation;
+        return acc;
+    }, 0)
+)
+
 console.log(ticketPriceTotal);
 
 // ==== Challenge 5: Be Creative ====

assignments/callbacks.js

@@ -1,5 +1,6 @@
 // Create a higher order function and invoke the callback function to test your work. You have been provided an example of a problem and a solution to see how this works with our items array.  Study both the problem and the solution to figure out the rest of the problems.
 
+
 const items = ['Pencil', 'Notebook', 'yo-yo', 'Gum'];
 
 /* 
@@ -27,25 +28,56 @@ const items = ['Pencil', 'Notebook', 'yo-yo', 'Gum'];
 
 function getLength(arr, cb) {
   // getLength passes the length of the array into the callback.
+  return cb(arr.length);
 }
 
+getLength(items, function(length){
+  console.log(length);
+});
+
 function last(arr, cb) {
   // last passes the last item of the array into the callback.
+  return cb(arr[arr.length-1]);
 }
 
+last(items, function(last){
+  console.log(last);
+})
+
+
 function sumNums(x, y, cb) {
   // sumNums adds two numbers (x, y) and passes the result to the callback.
+  return cb(x + y);
 }
 
+sumNums(10, 3, function(sum){
+  console.log(sum);
+});
+
 function multiplyNums(x, y, cb) {
   // multiplyNums multiplies two numbers and passes the result to the callback.
+  return cb(x * y);
 }
 
+multiplyNums(6, 4, function(product){
+  console.log(product);
+});
+
 function contains(item, list, cb) {
   // contains checks if an item is present inside of the given array/list.
   // Pass true to the callback if it is, otherwise pass false.
+  if (list.includes(item)){
+    return cb(true);
+  } else { 
+    return cb(false);
+  };
 }
 
+contains ('Gum', items, function(doesContain){
+  console.log(doesContain);
+})
+
+
 /* STRETCH PROBLEM */
 
 function removeDuplicates(array, cb) {

assignments/closure.js

@@ -1,6 +1,27 @@
 // ==== Challenge 1: Write your own closure ====
 // Write a simple closure of your own creation.  Keep it simple!
 
+const addTo = function(passed){
+
+  let add = function(inner){
+    return passed + inner;
+  }
+
+  return add;
+}
+
+console.log(addTo(6)(3));
+
+const RSVP = function(passed){
+
+  let waitlisted = function(inner){
+    return `Thank you, you've been added to the guest list under the name ${passed} for a party of ${inner}`;
+  }
+
+  return waitlisted;
+}
+
+console.log(RSVP("Virginia")(3));
 
 /* STRETCH PROBLEMS, Do not attempt until you have completed all previous tasks for today's project files */