2.1 KiB
id | title | challengeType | forumTopicId | dashedName |
---|---|---|---|---|
a9bd25c716030ec90084d8a1 | Chunky Monkey | 1 | 16005 | chunky-monkey |
--description--
Scrivi una funzione che divida un array (primo argomento) in gruppi di lunghezza pari a size
(secondo argomento) e li restituisca come un array bidimensionale.
--hints--
chunkArrayInGroups(["a", "b", "c", "d"], 2)
deve restituire [["a", "b"], ["c", "d"]]
.
assert.deepEqual(chunkArrayInGroups(['a', 'b', 'c', 'd'], 2), [
['a', 'b'],
['c', 'd']
]);
chunkArrayInGroups([0, 1, 2, 3, 4, 5], 3)
deve restituire [[0, 1, 2], [3, 4, 5]]
.
assert.deepEqual(chunkArrayInGroups([0, 1, 2, 3, 4, 5], 3), [
[0, 1, 2],
[3, 4, 5]
]);
chunkArrayInGroups([0, 1, 2, 3, 4, 5], 2)
deve restituire [[0, 1], [2, 3], [4, 5]]
.
assert.deepEqual(chunkArrayInGroups([0, 1, 2, 3, 4, 5], 2), [
[0, 1],
[2, 3],
[4, 5]
]);
chunkArrayInGroups([0, 1, 2, 3, 4, 5], 4)
deve restituire [[0, 1, 2, 3], [4, 5]]
.
assert.deepEqual(chunkArrayInGroups([0, 1, 2, 3, 4, 5], 4), [
[0, 1, 2, 3],
[4, 5]
]);
chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6], 3)
deve restituire [[0, 1, 2], [3, 4, 5], [6]]
.
assert.deepEqual(chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6], 3), [
[0, 1, 2],
[3, 4, 5],
[6]
]);
chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6, 7, 8], 4)
deve restituire [[0, 1, 2, 3], [4, 5, 6, 7], [8]]
.
assert.deepEqual(chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6, 7, 8], 4), [
[0, 1, 2, 3],
[4, 5, 6, 7],
[8]
]);
chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6, 7, 8], 2)
deve restituire [[0, 1], [2, 3], [4, 5], [6, 7], [8]]
.
assert.deepEqual(chunkArrayInGroups([0, 1, 2, 3, 4, 5, 6, 7, 8], 2), [
[0, 1],
[2, 3],
[4, 5],
[6, 7],
[8]
]);
--seed--
--seed-contents--
function chunkArrayInGroups(arr, size) {
return arr;
}
chunkArrayInGroups(["a", "b", "c", "d"], 2);
--solutions--
function chunkArrayInGroups(arr, size) {
let out = [];
for (let i = 0; i < arr.length; i += size) {
out.push(arr.slice(i, i + size));
}
return out;
}
chunkArrayInGroups(["a", "b", "c", "d"], 2);