Chunk Array — LeetCode 2677 Python Solution
EasyJavaScript
- Problem
- #2677
- Reading time
- 2 min
- Source
- leetcode.com
The problem
Given an array arr and a chunk size size, return a chunked array. A chunked array contains the original elements in arr, but consists of subarrays each of length size.
Example
- Input
- arr = [1,2,3,4,5], size = 1
- Output
- [[1],[2],[3],[4],[5]]
- Explanation
- The arr has been split into subarrays each with 1 element.
Complexity
| Measure | Complexity |
|---|---|
| Time | O(n) |
| Space | O(1) to O(n) auxiliary |
Related problems
Frequently asked questions
- How hard is LeetCode 2677. Chunk Array?
- LeetCode 2677. Chunk Array is rated Easy on LeetCode.
- What topics does LeetCode 2677. Chunk Array cover?
- LeetCode 2677. Chunk Array is tagged JavaScript on LeetCode.