Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
32 changes: 28 additions & 4 deletions assignments/array-methods.js
Original file line number Diff line number Diff line change
Expand Up @@ -56,28 +56,52 @@ 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(element => {
fullName.push(element.first_name + ' ' + element.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 = [];
runners.map(element =>{
allCaps.push(element.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(element){return(element.shirt_size==="L");});

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 = runners.reduce((total,amount)=>({donation: total.donation + amount.donation}));
console.log(ticketPriceTotal);

// ==== Challenge 5: Be Creative ====
// Now that you have used .forEach(), .map(), .filter(), and .reduce(). I want you to think of potential problems you could solve given the data set and the 5k fun run theme. Try to create and then solve 3 unique problems using one or many of the array methods listed above.

let emailAndCompany = [];
runners.forEach(element => { emailAndCompany.push(element.email + ' ' + element.company_name) });
console.log(emailAndCompany);
// Problem 1

let upperCompany = [];
runners.map(element => {upperCompany.push(element.company_name.toUpperCase()+ ' ' + element.first_name.toUpperCase())})
console.log(upperCompany);
// Problem 2
let largeDonos = runners.filter(function (element) { return (element.donation > 100); });

console.log(largeDonos);
// Problem 3
let bigContributors = [];

bigContributors = largeDonos.reduce((total, amount) => ({ donation: (total.donation + amount.donation) }));
console.log(bigContributors);

// Problem 3
let donors = runners.map (item => item.company_name);
/* prettier-ignore */
donors.forEach(company => donors[company] = runners.filter(item => item.company_name === company).map(item => item.donation).reduce((total, item) => total + item))
console.log (donors);
57 changes: 43 additions & 14 deletions assignments/callbacks.js
Original file line number Diff line number Diff line change
Expand Up @@ -2,51 +2,80 @@

const items = ['Pencil', 'Notebook', 'yo-yo', 'Gum'];

/*


//Given this problem:

function firstItem(arr, cb) {
// firstItem passes the first item of the given array to the callback function.
}
// function firstItem(arr, cb) {
// // firstItem passes the first item of the given array to the callback function.
// }

// Potential Solution:
function firstItem(arr, cb) {
return cb(arr[0]);
}
// // Potential Solution:
// function firstItem(arr, cb) {
// return cb(arr[0]);
// }

// firstItem(items, function(first) {
// console.log(first)
// });

firstItem(items, function(first) {
console.log(first)
});

*/


function getLength(arr, cb) {
// getLength passes the length of the array into the callback.
return cb(arr);
}
getLength(items, function(strLength){
console.log(items.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(lastValue){
console.log(lastValue);
})


function sumNums(x, y, cb) {
// sumNums adds two numbers (x, y) and passes the result to the callback.
return cb(x + y) ;
}

sumNums(2, 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(3, 4, function(mult){
console.log(mult);
});

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.
}
cb(list.includes(item))
}



contains('Pencil',items,function(contain){
console.log(contain);
});

/* STRETCH PROBLEM */

function removeDuplicates(array, cb) {
// removeDuplicates removes all duplicate values from the given array.
// Pass the duplicate free array to the callback function.
// Do not mutate the original array.
let dupFree = [];
cb

removeDuplicates(items,function(duplicate){
console.log(duplicate);
})
}
26 changes: 25 additions & 1 deletion assignments/closure.js
Original file line number Diff line number Diff line change
@@ -1,11 +1,35 @@
// ==== Challenge 1: Write your own closure ====
// Write a simple closure of your own creation. Keep it simple!

function square(){
let num = 5;
function logNum(){
console.log(num);
}

num = num**2;
return logNum;


}
let number = square();
number();




// ==== Challenge 2: Create a counter function ====
const counter = () => {
// Return a function that when invoked increments and returns a counter variable.
// Return a function that when invoked increments and returns a counter variable
let count = 0;

return()=>(++count);

};
const county = counter();

console.log(county())
console.log(county())
// Example usage: const newCounter = counter();
// newCounter(); // 1
// newCounter(); // 2
Expand Down