From 6620d7d41a91cb486ad1823ab47ac2daa293cfea Mon Sep 17 00:00:00 2001 From: D V Date: Wed, 22 Apr 2026 15:08:50 +0200 Subject: [PATCH] lab solved --- index.js | 35 ++++++++++++++++++++++++++++++++++- 1 file changed, 34 insertions(+), 1 deletion(-) diff --git a/index.js b/index.js index 6b0fec3ad..650e80d28 100644 --- a/index.js +++ b/index.js @@ -1,7 +1,40 @@ // Iteration 1: Names and Input +const hacker1 = "Daniel"; +console.log(`The drivers name is ${hacker1}`); +const hacker2 = "Alexandra" +console.log(`The navigators name is ${hacker2}`); -// Iteration 2: Conditionals +// 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 spaced = ""; +for (let i = 0; i < hacker1.length; i++) { + spaced += hacker1[i].toUpperCase(); + if (i < hacker1.length - 1) spaced += " "; +} +console.log(spaced); + +// 3.2 Navigator's name reversed +let reversed = ""; +for (let i = hacker2.length - 1; i >= 0; i--) { + reversed += hacker2[i]; +} +console.log(reversed); + +// 3.3 Lexicographic comparison +if (hacker1 < hacker2) { + console.log("The driver's name goes first."); +} else if (hacker1 > hacker2) { + console.log("Yo, the navigator goes first, definitely."); +} else { + console.log("What?! You both have the same name?"); +} \ No newline at end of file