FilesExpand file tree

 master

/

practice-lab.js

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

94 lines (71 loc) · 3.55 KB

 master

/

practice-lab.js

Copy path

Top

File metadata and controls

• Code
• Blame

94 lines (71 loc) · 3.55 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

// Iteration 1: Names and Input

// 1.1

let hacker1 = "Veronica";

// 1.2

console.log(`The driver's name is ${hacker1}`)

// 1.3

let hacker2 = "Michel";

// 1.4

console.log(`The navigator name is ${hacker2}`)

// Iteration 2: Conditionals

// 2.1

if (hacker1.length > hacker2.length) console.log(`The driver's name goes first`)

else if (hacker2.length > hacker1.length) console.log(`Yo, the navigator goes first definitely`);

else console.log(`What you got the same name?`)

// Iteration 3: Loops

// 3.1

let name = "Veronica"

let newName = "";

console.log(name.split('').join(' ').toUpperCase())

// 3.2

console.log(name.split('').reverse().join(''))

for (let i = name.length ; i >= 0; i--) {

newName += name.charAt(i)

}

console.log(newName)

// 3.3

let name1 = "Veronica";

let name2 = "Michel";

let namesArray = [];

namesArray.push(name1);

namesArray.push(name2);

namesArray.sort()

if (namesArray[0] === namesArray[1]) {

console.log(`What?! You both got the same name?`)

} else if (namesArray[0] === name1) {

console.log(`The drivers name goes first`)

} else if (namesArray[0] === name2) {

console.log(`Yo, the navigator goes first definitely`)

// Bonus Time!

let pharagraphs = `Lorem ipsum dolor sit amet, consectetur adipiscing elit. Cras at luctus enim, et rutrum augue. Orci varius natoque penatibus et magnis dis parturient montes, nascetur ridiculus mus. Phasellus nisl eros, fermentum eget magna vel, auctor iaculis urna. Integer nec feugiat velit, nec placerat augue. Fusce finibus mauris ac semper elementum. Nullam dignissim orci quis leo cursus malesuada. Aenean euismod, justo sit amet venenatis iaculis, orci odio imperdiet sem, eget lacinia dolor leo vel sapien. Ut in aliquam mauris. Integer est purus, euismod ac mattis in, volutpat eget nisi. Vivamus rhoncus sagittis lobortis.

Morbi placerat egestas tortor at euismod. In libero magna, volutpat a convallis vel, commodo sed justo. Duis nisl sapien, ornare vel felis et, blandit consequat elit. Aenean ex ligula, aliquam ac ex quis, imperdiet sollicitudin arcu. Etiam et eros leo. Maecenas non pharetra turpis. Aliquam erat volutpat. Fusce quis elit purus.

Nunc sed hendrerit diam. Duis auctor est ac erat tempor, at varius enim lobortis. Nam tincidunt consectetur lobortis. Proin sit amet neque interdum, fringilla enim ut, hendrerit tellus. Duis suscipit eros in lorem rhoncus tempus. Nunc feugiat massa faucibus pellentesque faucibus. Donec ac eros scelerisque, porttitor neque id, rutrum elit. Pellentesque in ante augue. Etiam quis nibh facilisis, scelerisque diam et, malesuada est. Sed enim est, accumsan in libero vel, mollis aliquet risus. Etiam a bibendum nunc. Quisque metus nisi, elementum tincidunt nunc sit amet, convallis convallis est. Vestibulum aliquam vestibulum est lobortis eleifend.`

// Solution words count

console.log(pharagraphs.split(' ').length) //235

// First Intent

let count = 0;

for (let i = 0; i < pharagraphs.length; i++) {

if(pharagraphs.includes("et")) {

count++;

}

}

console.log(count) // 1594

// Second Intent

console.log(pharagraphs.toLowerCase().split(' et').length) //9

// Third Intent

console.log(pharagraphs.toLowerCase().split(' et ').length) //4

// Third Intent

let numberOfEt = 0;

let newLetters = pharagraphs.toLowerCase().split(' ')

// console.log(newLetters)

for (let i = 0; i < newLetters.length; i++) {

if (newLetters[i] == "et") {

numberOfEt++;

}

}

console.log(numberOfEt) //3

// Final Result

let spacedEt = pharagraphs.toLowerCase().split(' et ').length;

let commaEt = pharagraphs.toLowerCase().split(' et,').length;

let result = spacedEt + commaEt

console.log(result) //7