Skip to content
Open
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
90 changes: 88 additions & 2 deletions index.js
Original file line number Diff line number Diff line change
@@ -1,7 +1,93 @@
let hacker1 = "Elchin";
let hacker2 = "Sevinc";
// Iteration 1: Names and Input


const printHackerNames = (hacker1, hacker2) => {
console.log(`The driver's name is ${hacker1}`)
console.log(`The navigator's name is ${hacker2}`)
}
printHackerNames(hacker1, hacker2);
// Iteration 2: Conditionals

const printLongName = (hacker1, hacker2) => {
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!`);
}
}
printLongName(hacker1, hacker2);


// Iteration 3: Loops
let driverName = "";
let upperName = hacker1.toUpperCase();
for (let i = 0; i < hacker1.length; i++) {
driverName += upperName[i] + " ";
}
console.log(driverName);
let driverNameRevers = "";
for (let i = hacker1.length - 1; i >= 0; i--) {
driverNameRevers += hacker1[i];
}
console.log(driverNameRevers);

if (hacker1 > hacker2) {
console.log("The driver's name goes first.");
} else if (hacker2 > hacker1) {
console.log("Yo, the navigator goes first, definitely.");
} else {
console.log("What?! You both have the same name?");
}

//Bonus 1
let longText = `Lorem ipsum dolor sit amet, consectetur adipiscing elit. Nullam in dui mauris. Vivamus hendrerit arcu sed erat molestie vehicula. Sed auctor neque eu tellus rhoncus ut eleifend nibh porttitor. Ut in nulla enim. Phasellus molestie magna non est bibendum non venenatis nisl tempor. Suspendisse dictum feugiat nisl ut dapibus. Mauris iaculis porttitor posuere. Praesent id metus massa, ut blandit odio. Proin quis tortor orci. Etiam at risus et justo dignissim congue. Donec congue lacinia dui, a porttitor lectus condimentum laoreet. Nunc eu ullamcorper orci. Quisque eget odio ac lectus vestibulum faucibus eget in metus. In pellentesque faucibus vestibulum. Nulla at nulla justo, eget luctus tortor.

Pellentesque eleifend consectetur adipiscing elit. Sed auctor neque eu tellus rhoncus ut eleifend nibh porttitor. Ut in nulla enim. Phasellus molestie magna non est bibendum non venenatis nisl tempor. Suspendisse dictum feugiat nisl ut dapibus. Mauris iaculis porttitor posuere. Praesent id metus massa, ut blandit odio. Proin quis tortor orci. Etiam at risus et justo dignissim congue. Donec congue lacinia dui, a porttitor lectus condimentum laoreet. Nunc eu ullamcorper orci. Quisque eget odio ac lectus vestibulum faucibus eget in metus. In pellentesque faucibus vestibulum. Nulla at nulla justo, eget luctus tortor. Nulla facilisi. Aenean nec eros. Vestibulum ante ipsum primis in faucibus orci luctus et ultrices posuere cubilia Curae; Suspendisse sollicitudin velit sed leo. Ut pharetra augue nec augue. Nam elit agna, endrerit sit amet, tincidunt ac, viverra sed, nulla.

Donec porta diam eu massa. Quisque diam lorem, interdum vitae, dapibus ac, scelerisque vitae, pede. Donec eget tellus non erat lacinia fermentum. Donec in velit vel ipsum auctor pulvinar. Vestibulum iaculis lacinia est. Proin dictum elementum velit. Fusce eleifend neque sit amet erat. Donec nibh dictum, lacinia et, suscipit non, semper a, orci. Cras purus velit, congue a, elementum et, posuere ac, nulla. Fusce elit. Morbi et massa sit amet velit rutrum placerat. Quisque condimentum pede. Donec bibendum pellentesque ipsum. Pellentesque imperdiet pede nec felis. Phasellus at lacus.`;

let word = "";
let arr = [];
let j = 0;
for (let i = 0; i < longText.length; i++) {
if (longText[i] != " ") {
word += longText[i];
} else if (longText[i] == " ") {
arr[j] = word;
word = "";
j++;
}
}
if (word !== "") {
arr[j] = word;
}

let etCount = 0;
for (let k = 0; k < arr.length; k++) {
let currentWord = arr[k];
if (currentWord === "et" || currentWord === "et," || currentWord === "et.") {
etCount++;
}
}
console.log(arr.length);
console.log(etCount);

//Bonus 2
let phraseToCheck = "A man, a plan, a canal, Panama!";
let fullWord = "";
for (let i = 0; i < phraseToCheck.length; i++) {
if (phraseToCheck[i] != " " && phraseToCheck[i] != "!" && phraseToCheck[i] != "," && phraseToCheck[i] != ".") {
fullWord += phraseToCheck[i].toLowerCase();
}
}
let reverseFullWord = "";
for (let i = fullWord.length - 1; i >= 0; i--) {
reverseFullWord += fullWord[i];
}
if (reverseFullWord === fullWord) {
console.log("this is palindromes");
} else {
console.log("this is not palindromes");
}