-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathchallenges.js
More file actions
120 lines (109 loc) · 4.89 KB
/
challenges.js
File metadata and controls
120 lines (109 loc) · 4.89 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
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
/* eslint-disable*/
/* ======================== CallBacks Practice ============================ */
const each = (elements, cb) => {
// Iterates over a list of elements, yielding each in turn to the `cb` function.
// This only needs to work with arrays.
for (let i = 0; i < elements.length; i++) { // //this each function takes a for loop and interates
cb(elements[i], i); // though the elements of the elements array and passes its values to cb one by one.
// cb needs to be invoked multiple times once for each value in the array
// therefore elements needed an iterator.
}
};
const map = (elements, cb) => {
// Produces a new array of values by mapping each value in list through a transformation function (iteratee).
// Return the new array.
const newarray = [];
for (let i = 0; i < elements.length; i++) { // this map function takes a for a loop and interates over the
newarray.push(cb(elements[i])); // each values in the array and passes each of the values in
// (elements), map passes each of the values in arr that the for
// loop iterates and passes all of the values to cb to be invoked map
} // keeps track of the results invoked by cb and creates a new array
// (const newarray) containing the values returned of the invocation
return newarray; // of cb that is the same length as the original array and assigns them
}; // const newarray where they are returned.
/* ======================== Closure Practice ============================ */
const limitFunctionCallCount = (cb, n) => {
// Should return a function that invokes `cb`.
// The returned function should only allow `cb` to be invoked `n` times.
let count = 0; // variable count to keep track of how many times cb was invoked.
const limitCall = (...args) => { // const limitCall invokes cb and uses the counter to keep track
if (count === n) {
return null;
}
// of how many times cb has been called since the instructions say
count++; // that cb can only be invoked n times.
return cb (...args);
}
return limitCall; // the variable limitCall returns the results of the invoking cb 'n' times
};
const cacheFunction = cb => {
const Cache = {};
return (input) => {
if (Object.prototype.hasOwnProperty.call(Cache, input)) {
return Cache[input];
}
else {
Cache[input] = cb (input);
return Cache[input];
}
}
// Should return a funciton that invokes `cb`.
// A cache (object) should be kept in closure scope.
// The cache should keep track of all arguments have been used to invoke this function.
// If the returned function is invoked with arguments that it has already seen
// then it should return the cached result and not invoke `cb` again.
// `cb` should only ever be invoked once for a given set of arguments.
};
/* eslint-enable no-unused-vars */
/* ======================== Recursion Practice ============================ */
const reverseStr = str => {
// reverse str takes in a string and returns that string in reversed order
// The only difference between the way you've solved this before and now is that you need to do it recursivley!
if (str === "") {
return "";
}
else return str.charAt(str.length - 1) + reverseStr (str.substr(0, str.length - 1));
//else return reverseStr (str.substr(0) + str.charAt(1);
};
const checkMatchingLeaves = obj => {
// return true if every property on `obj` is the same
// otherwise return false
const matchingLeaves = [];
function checkmatches(leaves) {
if (Object(leaves) === leaves)
{
const children = Object.keys(leaves).map (key => leaves [key]);
children.forEach(child => checkmatches(child));
// for (let i = 0; i < children.length; i++) {
// checkmatches(children[i]);
// }
} else {
matchingLeaves.push(leaves);
}
}
checkmatches(obj);
return matchingLeaves.length === 0 || matchingLeaves.every(leaf => leaf === matchingLeaves[0]);
};
const flatten = (elements) => {
let flattenarray = [];
for (let i = 0; i < elements.length; i++){
if (Array.isArray(elements[i])) {
flattenarray = flattenarray.concat(flatten(elements[i]));
}
else {
flattenarray.push(elements[i]);
}
}
return flattenarray;
// Flattens a nested array (the nesting can be to any depth).
// Example: flatten([1, [2], [3, [[4]]]]); => [1, 2, 3, 4];
};
module.exports = {
each,
map,
limitFunctionCallCount,
cacheFunction,
reverseStr,
checkMatchingLeaves,
flatten,
};