Basic Algorithms Lab

index.js

// Iteration 1: Names and Input

let hacker1 = "Joshua"
console.log(`The driver's name is ${hacker1}`);

let hacker2 = "Josh"
console.log(`The navigator's name is ${hacker2}`);

// Iteration 2: Conditionals

if (hacker1.length > hacker2.length) {
  console.log(`The driver has the longest name, it has ${hacker1.length} characters.`)
} else if (hacker2.length > hacker1.length) {
  console.log(`It seems that the navigator has the longest name, it has ${hacker2.length} characters.`)
} else {
  console.log(`Wow, you both have equally long names, ${hacker1.length} characters!`)
}

// Iteration 3: Loops
let spacedName = ''
for(let i =0; i < hacker1.length; i+=1){
  let capital = hacker1[i].toUpperCase()
  // if(i === 0){
  //   spacedName = spacedName + capital
  // }else{
  //   spacedName = spacedName + " " + capital
  // }
  spacedName += capital + ' '
}
let trimmed = spacedName.trim()
console.log('iteration 3', spacedName)

//Iteration 3.2 
let reversedName = ''
for(let i =hacker2.length -1; i >=0; i--){
  reversedName += hacker2[i]
}
console.log('Eric in reverse', reversedName)

//Iteration 3.3
let longestWord = ''
if(hacker1.length >= hacker2.length){
  longestWord = hacker1
}else{
  longestWord = hacker2
}
for(let i =0; i< longestWord.length; i++){
  if(hacker1 === hacker2){
    console.log('What?! You both have the same name?')
    break;
  }
  if(hacker1[i] < hacker2[i] || hacker1[i] === undefined){
    console.log(`The driver's ${hacker1} name goes first.`)
    break;
  }else if(hacker2[i] < hacker1[i] || hacker2[i] === undefined){
    console.log(`The navigator's ${hacker2} name goes first.`)
    break;
  }
}

let longText = `Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nullam feugiat mi aliquet sollicitudin bibendum. Suspendisse convallis at elit venenatis auctor. Nam sit amet enim ut nisl congue sodales eu id lectus. Donec tristique, nulla quis volutpat congue, ante ipsum maximus magna, quis tincidunt diam odio porta diam. Fusce ut ligula nec arcu blandit lobortis eget vel nibh. Duis a lectus id tortor aliquam consectetur. Etiam fringilla turpis tellus, imperdiet semper erat hendrerit non. Integer malesuada felis non porttitor facilisis. Pellentesque habitant morbi tristique senectus et netus et malesuada fames ac turpis egestas. Pellentesque volutpat rutrum risus, sit amet ultrices magna placerat sit amet. Morbi ut diam eu mauris lacinia vehicula id et nisi.
Nunc feugiat posuere justo vel accumsan. Nulla dictum sagittis ipsum vitae finibus. Maecenas id purus quis est egestas ultricies. Aliquam vitae placerat urna. Sed mi erat, rhoncus quis risus eu, facilisis sodales ipsum. Pellentesque habitant morbi tristique senectus et netus et malesuada fames ac turpis egestas. Cras interdum risus sed tortor facilisis egestas. Donec tellus augue, egestas ut sem non, vestibulum viverra arcu. Nullam tempus lorem ut metus viverra, a hendrerit turpis luctus. Nullam ornare dui quis viverra facilisis. Vestibulum quis vestibulum erat. Ut ultricies, nibh nec tincidunt tristique, sapien dui pulvinar diam, vel vehicula arcu velit sit amet dui et.

Aliquam tincidunt dui vestibulum, malesuada erat quis, accumsan ante. Phasellus consequat maximus enim et ultricies. Praesent pellentesque tempor congue. Pellentesque scelerisque nec nisl id feugiat. Vivamus pulvinar felis semper, tempus lorem eget, viverra enim. Aenean molestie malesuada nisi, non convallis elit luctus quis. Aenean ligula ex, dapibus et dignissim sit amet, convallis vitae lacus. Suspendisse nec sapien sit amet orci luctus tempor.`

let newArray = longText.split(' ')
console.log(`There are ${newArray.length} words in the longText variable`)

//Counting the et in longText
let etCount = 0
for(let i = 0; i < newArray.length; i++){
  if(newArray[i] === 'et'){
    etCount ++
  }
}
console.log(`There are ${etCount} ets in the longText variable `)

//bonus 2 Time!
let word = "taco cata"
let cleanWord = ''
let reversedWord = ''

//charcodeat example
// console.log('charcode', word.charCodeAt(0))
for(let i =0; i< word.length; i+=1){
  if(word[i] >= 'A' && word[i] <= 'z'){
    cleanWord += word[i].toLowerCase()
  }
}
for(let i = cleanWord.length-1; i >= 0; i--){
  reversedWord += cleanWord[i]
}

if(reversedWord === cleanWord){
  console.log('yep its a palidrome')
}else{
  console.log('Oh no, its not a palidrome')
}