forked from bloominstituteoftechnology/JavaScript-I
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcallbacks.js
More file actions
95 lines (78 loc) · 2.39 KB
/
callbacks.js
File metadata and controls
95 lines (78 loc) · 2.39 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
//Start test assignments
const items = ['Pencil', 'Notebook', 'yo-yo', 'Gum', 'Gum', 'Pencil'];
const numbers = [1, 5, 2, 2, 10, 11, 22, 22, 22, 11, 9, 10, 12];
// let numOne = function (arr) {
// return arr;
// };
let numOne = a => a;
// End test assignments
// function firstItem(arr, cb) {
// // firstItem passes the first item of the given array to the callback function.
// return cb(arr[0]);
// }
let firstItem = (arr,cb) => cb(arr[0]);
// function getLength(arr, cb) {
// // getLength passes the length of the array into the callback.
// return cb(arr.length);
// }
let getLength = (arr, cb) => cb(arr.length);
// function last(arr, cb) {
// // last passes the last item of the array into the callback.
// return cb(arr[arr.length - 1]);
// }
let last = (arr, cb) => cb(arr[arr.length - 1])
// function sumNums(x, y, cb) {
// // sumNums adds two numbers (x, y) and passes the result to the callback.
// return cb(x + y);
// }
let sumNums = (x, y, cb) => cb(x + y);
// function multiplyNums(x, y, cb) {
// // multiplyNums multiplies two numbers and passes the result to the callback.
// return cb(x * y);
// }
let multiplyNums = (x, y, cb) => cb(x * y);
// function contains(item, list, cb) {
// // contains checks if an item is present inside of the given array/list.
// // Pass true to the callback if it is, otherwise pass false.
// if (list.includes(item) === true) {
// return cb(true);
// } else {
// return cb(false);
// }
// }
let contains = (item, list, cb) => {
if (list.includes(item) === true) {
return cb(true);
} else {
return cb(false);
}
}
/* STRETCH PROBLEM */
// function removeDuplicates(array, cb) {
// // removeDuplicates removes all duplicate values from the given array.
// // Pass the duplicate free array to the callback function.
// // Do not mutate the original array.
// let newArr = [];
// array.sort();
// for (let i = 0; i < array.length; i++) {
// let a = array[i + 1];
// if (a !== array[i]) {
// newArr.push(array[i]);
// }
// }
// return cb(newArr);
// }
let removeDuplicates = (array, cb) => {
let newArr = [];
array.sort();
for (let i = 0; i < array.length; i++) {
let a = array[i + 1];
if (a !== array[i]) {
newArr.push(array[i]);
}
}
return cb(newArr);
}
console.log(removeDuplicates(numbers, numOne));
// for (let a = i + 1; a < array.length; a++) {
// if (a === i)