Problem
Splitting data into fixed-size chunks is how programs page results, batch database writes or send data in packets.
Given a list and a chunk size, cut the list into consecutive chunks of exactly size values, in order. The last chunk holds whatever is left and may be shorter.
Implement split_into_chunks(values, size).
Input
values: The list to split.
size: The chunk size.
Output
Return the list of chunks. An empty list gives no chunks.
Constraints
0 ≤ number of values ≤ 10,000
1 ≤ size ≤ 10,000
Examples
Input:
size = 3
values = [1, 2, 3, 4, 5, 6, 7]
Expected output:
expected = [
[1, 2, 3],
[4, 5, 6],
[7]
]Input:
long long size = 3;
std::vector<long long> values = {1, 2, 3, 4, 5, 6, 7};
Expected output:
std::vector<std::vector<long long>> expected = {
{1, 2, 3},
{4, 5, 6},
{7}
};Input:
long size = 3;
long[] values = new long[] {1, 2, 3, 4, 5, 6, 7};
Expected output:
long[][] expected = new long[][] {
new long[] {1, 2, 3},
new long[] {4, 5, 6},
new long[] {7}
};Explanation
Groups of 3: [1, 2, 3] and [4, 5, 6], and the leftover 7 forms a last, shorter chunk.
Input:
size = 5
values = [8, 9]
Expected output:
expected = [
[8, 9]
]Input:
long long size = 5;
std::vector<long long> values = {8, 9};
Expected output:
std::vector<std::vector<long long>> expected = {
{8, 9}
};Input:
long size = 5;
long[] values = new long[] {8, 9};
Expected output:
long[][] expected = new long[][] {
new long[] {8, 9}
};Explanation
The size is larger than the list, so everything fits in one chunk: [[8, 9]].
How to approach it
Try on your own first, then open one hint at a time.
Hint 1
Start positions are 0, size, 2·size, and so on.
Hint 2
Take a slice from each start position up to start + size.
Hint 3
The last slice may be shorter, and an empty list gives no chunks at all.
Expected complexity
O(n) time, O(n) extra space
References
This challenge is adapted for CodeUtility. Follow the statement and constraints above.