-
Notifications
You must be signed in to change notification settings - Fork 2.3k
sagar desai #49
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Closed
sagardesai90
wants to merge
3
commits into
bloominstituteoftechnology:master
from
sagardesai90:master
Closed
sagar desai #49
Changes from all commits
Commits
Show all changes
3 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -56,28 +56,74 @@ 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 = []; | ||
| //console.log(fullName); | ||
| runners.forEach(function(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 = []; | ||
| // console.log(allCaps); | ||
| // fullName.forEach(function(element){ | ||
| // allCaps.push(element.toUpperCase()); | ||
| // }) | ||
| allCaps = fullName.map(el => el.toUpperCase()); | ||
| console.log(allCaps); | ||
|
|
||
| // ==== Challenge 3: Use .filter() ==== | ||
| // ==== 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 = []; | ||
| // runners.forEach(function(element){ | ||
| // largeShirts.push() | ||
| // }) | ||
| largeShirts = runners.filter(el => el.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 = []; | ||
| console.log(ticketPriceTotal); | ||
| ticketArr = runners.map(el => el.donation) | ||
| console.log(ticketArr); | ||
| ticketPriceTotal = (accumulator, current) => accumulator + current; | ||
| console.log(ticketArr.reduce(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 solve 3 unique problems using one or many of the array methods listed above. | ||
|
|
||
| // Problem 1 | ||
| // Problem 1: Show a list of all the companies being represented by the runners. | ||
| let corpList = []; | ||
| corpList = runners.map(el => el.company_name); | ||
| console.log("#1"); | ||
| console.log(corpList.sort()); | ||
|
|
||
| // Problem 2 | ||
| // Problem 2: Break down donations into categories: 0-100, 100-200, etc. | ||
| let donorLevels = {"bronze": 0, "silver": 0,"gold": 0, "platinum": 0}; | ||
|
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Awesome work! In each one of these questions. |
||
| runners.forEach(function(el){ | ||
| if (el.donation <= 100){ | ||
| donorLevels["bronze"] += 1; | ||
| } else if (el.donation <= 200 && el.donation > 100){ | ||
| donorLevels["silver"] += 1; | ||
| } else if (el.donation <= 300 && el.donation > 200){ | ||
| donorLevels["gold"] += 1; | ||
| } else if (el.donation > 300){ | ||
| donorLevels["platinum"] += 1; | ||
| } | ||
| }) | ||
| console.log(donorLevels); | ||
|
|
||
| // Problem 3 | ||
| // Problem 3: Any duplicated first names? | ||
| let nameBadgeDuplicates = []; | ||
| let nameCounts = {}; | ||
| let firstNames = runners.map(el => el.first_name); | ||
| console.log(firstNames); | ||
| firstNames.forEach(function(el){ | ||
| console.log(el); | ||
| if (nameCounts[el] != true){ | ||
| nameCounts[el] = 1; | ||
| } else if (nameCounts[el] == true){ | ||
| nameCounts[el] += 1; | ||
| } | ||
| }) | ||
| console.log(nameCounts); | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,19 +1,43 @@ | ||
| // ==== Challenge 1: Write your own closure ==== | ||
| // Write a simple closure of your own creation. Keep it simple! | ||
|
|
||
| let scoot = "Ride sharing service in SF for electric scooters"; | ||
| function whatIsScoot(){ | ||
| return scoot; | ||
|
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Well done. |
||
| } | ||
| console.log(whatIsScoot()); | ||
|
|
||
| // ==== Challenge 2: Create a counter function ==== | ||
| const counter = () => { | ||
| const counter = (closure = 0) => { | ||
| // Return a function that when invoked increments and returns a counter variable. | ||
| let val = closure; | ||
| return function counter(){ | ||
| val += 1; | ||
| console.log(val); | ||
| return val; | ||
| } | ||
| }; | ||
| const newCounter = counter(); | ||
| // Example usage: const newCounter = counter(); | ||
| // newCounter(); // 1 | ||
| // newCounter(); // 2 | ||
| newCounter(); // 1 | ||
| newCounter(); // 2 | ||
|
|
||
|
|
||
| // ==== Challenge 3: Create a counter function with an object that can increment and decrement ==== | ||
| const counterFactory = () => { | ||
| // Return an object that has two methods called `increment` and `decrement`. | ||
| let counter = 0; | ||
| console.log(counter); | ||
| let increment = () => counter += 1; | ||
| let decrement = () => counter -= 1; | ||
| let resObj = {increment , decrement}; | ||
| // `increment` should increment a counter variable in closure scope and return it. | ||
|
|
||
| // `decrement` should decrement the counter variable and return it. | ||
| return resObj; | ||
|
|
||
| }; | ||
| let foo = counterFactory(); | ||
|
|
||
| console.log(foo.decrement()); | ||
| console.log(foo.increment()); | ||
| // return resObj; | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,23 +1,29 @@ | ||
| // Take the commented ES5 syntax and convert it to ES6 arrow Syntax | ||
|
|
||
| // let myFunction = function () {}; | ||
| let myFunction = ((el) => (el)); | ||
|
|
||
| // let anotherFunction = function (param) { | ||
| // return param; | ||
| // }; | ||
|
|
||
| let anotherFunction = ((param) => param); | ||
| console.log(anotherFunction("hello")); | ||
| // let add = function (param1, param2) { | ||
| // return param1 + param2; | ||
| // }; | ||
| // add(1,2); | ||
| let add = ((param1, param2) => param1 + param2); | ||
| console.log(add(1,2)); | ||
|
|
||
| // let subtract = function (param1, param2) { | ||
| // return param1 + param2; | ||
| // }; | ||
| // subtract(1,2); | ||
| let subtract = ((param1, param2) => param1 - param2); | ||
| console.log(subtract(1,2)); | ||
|
|
||
| exampleArray = [1,2,3,4]; | ||
|
|
||
| // const triple = exampleArray.map(function (num) { | ||
| // return num * 3; | ||
| // }); | ||
| // console.log(triple); | ||
| const triple = exampleArray.map(num => num * 3); | ||
| console.log(triple); |
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Perfect.