@@ -8,6 +8,7 @@ function maxOfTwoNumbers(num1, num2) {
8
8
}
9
9
}
10
10
11
+
11
12
// Iteration #2: Find longest word
12
13
const words = [ 'mystery' , 'brother' , 'aviator' , 'crocodile' , 'pearl' , 'orchard' , 'crackpot' ] ;
13
14
@@ -28,6 +29,7 @@ function findLongestWord(anArr) {
28
29
return longestWord
29
30
}
30
31
32
+
31
33
// Iteration #3: Calculate the sum
32
34
const numbers = [ 6 , 12 , 1 , 18 , 13 , 16 , 2 , 1 , 8 , 10 ] ;
33
35
@@ -41,6 +43,7 @@ function sumNumbers(anArr) {
41
43
return total
42
44
}
43
45
46
+
44
47
// Iteration #3.1 Bonus:
45
48
function sum ( ) { }
46
49
@@ -62,6 +65,7 @@ function averageNumbers(anArr) {
62
65
return average ;
63
66
}
64
67
68
+
65
69
// Level 2: Array of strings
66
70
const wordsArr = [ 'seat' , 'correspond' , 'linen' , 'motif' , 'hole' , 'smell' , 'smart' , 'chaos' , 'fuel' , 'palace' ] ;
67
71
@@ -79,9 +83,11 @@ function averageWordLength(anArr) {
79
83
return average
80
84
}
81
85
86
+
82
87
// Bonus - Iteration #4.1
83
88
function avg ( ) { }
84
89
90
+
85
91
// Iteration #5: Unique arrays
86
92
const wordsUnique = [
87
93
'crab' ,
@@ -97,8 +103,18 @@ const wordsUnique = [
97
103
'bring'
98
104
] ;
99
105
100
- function uniquifyArray ( ) { }
101
-
106
+ function uniquifyArray ( anArr ) {
107
+ if ( anArr . length == 0 )
108
+ return null
109
+
110
+ let result = [ ]
111
+ for ( let i = 0 ; i < anArr . length ; i ++ ) {
112
+ if ( ! result . includes ( anArr [ i ] ) ) {
113
+ result . push ( anArr [ i ] )
114
+ }
115
+ }
116
+ return result
117
+ }
102
118
103
119
104
120
// Iteration #6: Find elements
0 commit comments