forked from ironhack-labs/lab-javascript-basic-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathindex.js
More file actions
106 lines (74 loc) · 3.75 KB
/
index.js
File metadata and controls
106 lines (74 loc) · 3.75 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
// Iteration 1: Names and Input
let hacker1 = "pepu"
console.log(`The driver's name is ${hacker1}`)
let hacker2 = "pepuel"
console.log(`The navigator's name is ${hacker2}`)
console.log(hacker1.length)
// Iteration 2: Conditional
function comprobarTamaño (hacker1, hacker2) {
if (hacker1.length > hacker2.length) {
console.log(`the driver has the longest namel, 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, both have equally long names, ${hacker1.length} characters.`) }
}
comprobarTamaño (hacker1, hacker2)
// Iteration 3: Loops
function driverLettersseparation (hacker1) {
let result = "";
for (let i = 0; i < hacker1.length; i++) {
result += hacker1[i] + " ";
}
console.log(result.toUpperCase())
}
driverLettersseparation(hacker1)
function hackerReverse (hacker1) {
let hacker1R = hacker1.split('').reverse().join('')
console.log(hacker1R);
}
hackerReverse(hacker1);
let phraseA = "The driver's name goes first"
let phraseB = "Yo, the navigator goes first, definitely"
let phraseC = "What?! you both have the same name?"
function checkLexico(name1, name2) {
if (name1 > name2) {
console.log(phraseA);
} else if (name2 > name1) {
console.log(phraseB);
} else { console.log(phraseC)
} }
checkLexico (hacker1, hacker2)
let longTExt = "Lorem ipsum dolor sit amet, consectetur et adipiscing elit. Duis ac et leo eu orci consectetur eleifend. Donec et laoreet nisi, quis volutpat nunc. Nam ac ligula turpis. Orci varius natoque penatibus et magnis dis parturient montes, nascetur ridiculus mus. Suspendisse potenti. Phasellus sed ex eu lectus cursus sodales. Praesent ultrices commodo tortor, a dictum dui efficitur sollicitudin. Nulla sit amet nunc luctus, fermentum nisl quis, hendrerit lacus. Integer nibh erat, tincidunt vitae eros vel, bibendum consectetur nibh. Nulla at ante quis dolor ultricies porta id id nisl. Quisque dignissim sodales sapien ut tincidunt. Morbi mi ex, rhoncus id magna et, malesuada gravida dui. Nullam pharetra, quam ac faucibus lobortis, eros odio accumsan magna, quis eleifend mi justo vel ex. Aliquam semper ligula dolor, pretium finibus tellus elementum ut. Sed vitae augue metus. Nulla lacinia velit nec ligula malesuada, at hendrerit urna volutpat. Quisque tempus nisl eget feugiat ullamcorper. Etiam tincidunt fringilla vehicula. Proin sed orci et dolor sollicitudin ultrices. Donec metus nulla, molestie id urna non, vehicula malesuada diam. Pellentesque ac varius turpis. Proin quis posuere lectus, at scelerisque augue. Donec eget nunc eu nunc vehicula ornare. Praesent ullamcorper malesuada finibus. Nulla ultricies vulputate enim, blandit dapibus leo ornare et. Sed molestie efficitur placerat."
console.log(longTExt.length)
let longTExtarray = longTExt.split(' ')
function countingE (array) {
let sumaEt = 0;
for (let i = 0; i < array.length; i++) {
if (array[i] === "et") {
sumaEt += 1;
}
}
console.log(sumaEt)
}
countingE(longTExtarray)
function phraseToCheck (phrase) {
let result = "";
for (let i = 0; i < phrase.length; i++) {
let char = phrase[i].toLowerCase();
if ("a" <= char && "z" >= char) {
result += char;
}
console.log(result);
}
let reverse = ''
for (let i = result.length - 1; i >= 0; i--) {
reverse += result[i]
}
console.log(reverse)
if (result === reverse) {
console.log("es un palindrome");
} else {
console.log("no es un palindrome")}
}
let phrase1 = "tacox cat"
phraseToCheck(phrase1)