Created
March 3, 2021 20:45
-
-
Save alexcrist/8f743ca66026c0a821177b694c13e12f to your computer and use it in GitHub Desktop.
This file contains 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
// ##### Introduction ##### | |
// | |
// The below assignment will require NO functions | |
// | |
// Instead, our focus is going to be on console.logging the characters at certain indices of strings. | |
// | |
// ##### Challenges ##### | |
console.log('##### Challenge 1 #####'); | |
// 1. | |
// | |
// Console out the numbers from 1-20, but only if they're divisible by 3. | |
// Hint: Use `if` and a modulus operation. | |
for (let i = 1; i <= 20; i++) { | |
if (i % 3 === 0) { | |
console.log(i); | |
} | |
} | |
console.log('##### Challenge 2 #####'); | |
// 2. | |
// | |
// Console out the numbers from 1-20. BACKWARDS. | |
for (let i = 2000; i >= 1; i--) { | |
console.log(i); | |
} | |
console.log('##### Challenge 3 #####'); | |
// 3. | |
// | |
// For the string 'Boy howdy am I good at this!', console out the letters | |
// individually. | |
let string3 = 'Boy howdy am I good at this!'; | |
for (const letter of string3) { | |
if (letter !== ' ') { | |
console.log(letter); | |
} | |
} | |
console.log('##### Challenge 4 #####'); | |
// 4. | |
// | |
// For the string, 'And getting better every day.', starting with the second | |
// character, print out every third character. | |
let string4 = 'And getting better every day.'; | |
// n g t g ... | |
for (let i = 1; i < string4.length; i = i + 3) { | |
console.log(string4[i]); | |
} | |
console.log('##### Challenge 5 #####'); | |
// 5. | |
// | |
// For the string 'Am I the best?', console out the letters individually, AND | |
// UPPERCASED. | |
let string5 = 'Am I the best?'; | |
for (const letter of string5) { | |
console.log(letter.toUpperCase()); | |
} | |
console.log('##### Challenge 6 #####'); | |
// 6. | |
// | |
// For the string 'Whoa, I am the best!', console out the letters individually, | |
// but also capitalize the letters in the third word. | |
let string6 = 'Whoa, we are the best!'; | |
let numSpacesBefore = 0; | |
for (const letter of string6) { | |
// Handle spaces | |
if (letter === ' ') { | |
numSpacesBefore = numSpacesBefore + 1; | |
} | |
// Handles other chars | |
if (numSpacesBefore === 2) { | |
console.log(letter.toUpperCase(), numSpacesBefore); | |
} else { | |
console.log(letter, numSpacesBefore); | |
} | |
} | |
console.log('##### Challenge 7 #####'); | |
// 7. | |
// | |
// For the string 'I am become death, destroyer of worlds.', console out the letters | |
// individually, but backwards. That is, the first console log should be | |
// `.`, followed by `s`, followed by `d`, and so on. | |
let string7 = 'I am become death, destroyer of worlds.'; | |
for (let i = string7.length - 1; i >= 0; i--) { | |
console.log(string7[i]); | |
} | |
console.log('##### Challenge 8 #####'); | |
// 8. | |
// | |
// let name = ''; | |
// '' => 'A' => 'Al' => 'Ale' => 'Alex' | |
// '' => 'M' => 'Me' => 'Mes' => ... | |
const names = 'Alex|Mesuara|Brian|Chanel|Matt|Jeremy B.|Jose|Andy|Dustin|Joshua|Steve H.|Cesar|Nastya|Jeremy L.|Michael|John|Lee|Ruth|Steve M.|Tim|Ronny|Stevie R|Neo|Rick|Kyle|Minahil|Adam|Sonny|James|Daisy|Willie'; | |
// Console out the individual letters of each person in class, which are | |
// in the string above. Every time you start a new name (including the first | |
// one!), console out the string: 'Here today is:'. | |
// You'll know you're at a new person's name when you hit the pipe character. | |
// Don't print the pipes! | |
// Here today is: Alex | |
// Here today is: | |
// A | |
// l | |
// e | |
// x | |
let name = ''; | |
for (const char of names) { | |
if (char === '|') { | |
console.log(`Here today is: ${name}`); | |
name = ''; | |
} else { | |
name = name + char; | |
} | |
} | |
console.log(`Here today is: ${name}`); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment