1
1
// Iteration #1: Find the maximum
2
- function maxOfTwoNumbers ( ) { }
3
-
2
+ // Implement the function maxOfTwoNumbers that takes two numbers as arguments and returns the largest.
3
+ function maxOfTwoNumbers ( num1 , num2 ) {
4
+ if ( num1 > num2 ) {
5
+ return num1
6
+ } else {
7
+ return num2
8
+ }
9
+ }
4
10
11
+ console . log ( maxOfTwoNumbers ( 1 , 2 ) )
5
12
6
13
// Iteration #2: Find longest word
7
14
const words = [ 'mystery' , 'brother' , 'aviator' , 'crocodile' , 'pearl' , 'orchard' , 'crackpot' ] ;
15
+ function findLongestWord ( array ) {
16
+ let longstr = '' ;
17
+ for ( let i = 0 ; i < array . length ; i ++ ) {
18
+ if ( array [ i ] . length > longstr , length ) {
19
+ longstr = array [ i ]
20
+ }
21
+ }
22
+ return longest ;
23
+ }
24
+
8
25
9
- function findLongestWord ( ) { }
10
26
11
27
12
28
13
29
// Iteration #3: Calculate the sum
14
30
const numbers = [ 6 , 12 , 1 , 18 , 13 , 16 , 2 , 1 , 8 , 10 ] ;
15
31
16
- function sumNumbers ( ) { }
32
+ function sumNumbers ( array ) {
33
+ let sum = 0 ;
34
+ for ( let i = 0 ; i < array . length ; i ++ ) {
35
+ sum += array [ i ] ;
36
+ }
37
+ return sum ;
38
+ }
39
+
40
+
17
41
18
42
19
43
20
44
// Iteration #3.1 Bonus:
21
- function sum ( ) { }
45
+
46
+ const mixedArr = [ 6 , 12 , 'miami' , 1 , true , 'barca' , '200' , 'lisboa' , 8 , 10 ] ;
47
+
48
+ function sum ( mixArr ) {
49
+ let total = 0 ;
50
+ for ( let i = 0 ; i < mixArr . length ; i ++ ) {
51
+ if ( typeof mixArr [ i ] === "number" ) {
52
+ total + - mixArr [ i ]
53
+ } else if ( typeof mixArr [ i ] === "string" ) {
54
+ total + - mixArr [ i ] . length
55
+ } else if ( typeof mixArr [ i ] === "boolean" )
56
+ if ( mixArr [ i ] === true ) {
57
+
58
+ } else {
59
+ continue
60
+ }
61
+ }
62
+ return total
63
+ }
64
+
65
+
66
+
67
+
22
68
23
69
24
70
25
71
// Iteration #4: Calculate the average
26
72
// Level 1: Array of numbers
27
73
const numbersAvg = [ 2 , 6 , 9 , 10 , 7 , 4 , 1 , 9 ] ;
28
74
29
- function averageNumbers ( ) { }
75
+ function averageNumbers ( numbers ) {
76
+ let sum = 0 ;
77
+ if ( numbers . length === 0 ) {
78
+ return null ;
79
+ }
80
+ for ( let i = 0 ; i < numbers . length ; i ++ ) {
81
+ sum += numbers [ i ] ;
82
+ }
83
+ return sum / numbers . length ;
84
+ }
85
+
30
86
31
87
32
88
// Level 2: Array of strings
@@ -53,7 +109,10 @@ const wordsUnique = [
53
109
] ;
54
110
55
111
function uniquifyArray ( ) { }
112
+ let cleanArray
113
+
56
114
115
+
57
116
58
117
59
118
// Iteration #6: Find elements
0 commit comments