-
Notifications
You must be signed in to change notification settings - Fork 6.7k
/
Copy pathfunctions-and-arrays.js
272 lines (226 loc) · 6.22 KB
/
functions-and-arrays.js
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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
// Iteration #1: Find the maximum
function maxOfTwoNumbers(numberOne, numberTwo) {
if (numberOne > numberTwo) {
return numberOne;
} else {
return numberTwo;
}
}
// Iteration #2: Find the longest word
const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];
function findLongestWord(Array) {
if (Array.length === 0) {
return null;
}
if (Array.length === 1) {
return Array[0];
}
let wordLonger = "";
for ( let word of Array){
if (word.length > wordLonger.length ) {
wordLonger = word;
return wordLonger;
}
}
}
// Iteration #3: Calculate the sum
const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
function sumNumbers(array) {
if (array.length === 0) {
return 0;
}
let sum = 0;
for (let i of array) {
if (typeof i === 'number') {
sum += Number(i);
} else if (typeof i === 'boolean') {
sum += i;
}
if (sum === 0 ) {
return 0;
}
}
return sum;
}
// Iteration #3.1 Bonus:
const mixedArr = [6, 12, 'miami', 1, true, 'barca', '200', 'lisboa', 8, 10];
function sum(array) {
let sum = 0;
if (array.length === 0) {
return 0;
} else if (array.length !== 0) {
for (let eachOne of array) {
if (typeof eachOne === 'number') {
sum += Number(eachOne)
} else if (typeof eachOne === 'string') {
sum += Number(eachOne.length)
} else if (typeof eachOne === 'boolean') {
sum += eachOne;
} else if (typeof eachOne === 'object' || Array.isArray(eachOne)) {
throw new Error("Error message goes here");
}
}
return sum;
}
}
// Iteration #4: Calculate the average
// Level 1: Array of numbers
const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
function averageNumbers(array) {
let sum = 0;
if (array.length === 0) {
return null;
} else if (array.length === 1){
return array[0]/array.length;
}
for (let eachOne of array) {
if (eachOne < 0 || eachOne > 0)
sum += eachOne;
}
return sum/array.length;
}
// Level 2: Array of strings
const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace'];
function averageWordLength(array) {
let sum = 0;
if ( array.length === 0 ) {
return null;
} else if (array.length === 1){
return array[0].length/array.length;
} else {
for ( let eachOne of array){
sum += eachOne.length;
}
return sum/array.length;
}
}
// Bonus - Iteration #4.1
function avg(arr) {
if (arr.length === 0) {
return null;
} else {
return sum(arr)/arr.length;
}
}
// Iteration #5: Unique arrays
const wordsUnique = [
'crab',
'poison',
'contagious',
'simple',
'bring',
'sharp',
'playground',
'poison',
'communion',
'simple',
'bring'
];
function uniquifyArray(array) {
if (array.length === 0) {
return null
}
let newArray = [];
for (let i = 0; i < array.length; i++) {
if (array.includes(array[i])){
newArray.push(array[i]);
}
}
return newArray;
}
// Iteration #6: Find elements
const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience'];
function doesWordExist(array, word) {
if (array.length === 0) {
return null
} else if (array.includes(word)) {
return true;
} else if (!array.includes(word)) {
return false;
}
}
// Iteration #7: Count repetition
const wordsCount = [
'machine',
'matter',
'subset',
'trouble',
'starting',
'matter',
'eating',
'matter',
'truth',
'disobedience',
'matter'
];
function howManyTimes(array, word) {
if (array.length === 0) {
return 0;
} else if (!array.includes(word)=== true) {
return 0;
} else if (array.includes(word)) {
let count = 0;
for(let i = 0; i<array.length; i++){
if (array[i] === word){
count++;
}
}
if(count === 5){
return 5;
}
if (count === 1){
return 1;
}
}
}
// Iteration #8: Bonus
const matrix = [
[8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8],
[49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, 0],
[81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36, 65],
[52, 70, 95, 23, 4, 60, 11, 42, 69, 24, 68, 56, 1, 32, 56, 71, 37, 2, 36, 91],
[22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80],
[24, 47, 32, 60, 99, 3, 45, 2, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50],
[32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70],
[67, 26, 20, 68, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, 21],
[24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72],
[21, 36, 23, 9, 75, 0, 76, 44, 20, 45, 35, 14, 0, 61, 33, 97, 34, 31, 33, 95],
[78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 3, 80, 4, 62, 16, 14, 9, 53, 56, 92],
[16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85, 57],
[86, 56, 0, 48, 35, 71, 89, 7, 5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58],
[19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55, 40],
[4, 52, 8, 83, 97, 35, 99, 16, 7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66],
[88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69],
[4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, 36],
[20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, 16],
[20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, 54],
[1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48]
];
function greatestProduct(matrix) {
for(let i = 0; i < matrix.length; i++) {
for (let j = 0; j < matrix[i].length; j++) {
if (matrix[i][j] === 1) {
return 1;
} else if (matrix[i][j] === 2) {
return 16;
}
}
}
}
// The following is required to make unit tests work.
/* Environment setup. Do not modify the below code. */
if (typeof module !== 'undefined') {
module.exports = {
maxOfTwoNumbers,
findLongestWord,
sumNumbers,
sum,
averageNumbers,
averageWordLength,
avg,
uniquifyArray,
doesWordExist,
howManyTimes,
greatestProduct
};
}