Add solution #2677

Author: JoshCrozier

README.md

@@ -398,6 +398,7 @@
 2665|[Counter II](./2665-counter-ii.js)|Easy|
 2666|[Allow One Function Call](./2666-allow-one-function-call.js)|Easy|
 2667|[Create Hello World Function](./2667-create-hello-world-function.js)|Easy|
+2677|[Chunk Array](./2677-chunk-array.js)|Easy|
 2703|[Return Length of Arguments Passed](./2703-return-length-of-arguments-passed.js)|Easy|
 3110|[Score of a String](./3110-score-of-a-string.js)|Easy|
 3392|[Count Subarrays of Length Three With a Condition](./3392-count-subarrays-of-length-three-with-a-condition.js)|Easy|

solutions/2677-chunk-array.js

@@ -0,0 +1,31 @@
+/**
+ * 2677. Chunk Array
+ * https://leetcode.com/problems/chunk-array/
+ * Difficulty: Easy
+ *
+ * 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. The length of the last subarray may be less than size if arr.length is not
+ * evenly divisible by size.
+ *
+ * You may assume the array is the output of JSON.parse. In other words, it is valid JSON.
+ *
+ * Please solve it without using lodash's _.chunk function.
+ */
+
+/**
+ * @param {Array} arr
+ * @param {number} size
+ * @return {Array}
+ */
+var chunk = function(arr, size) {
+  var result = [];
+
+  for (let index = 0; index < arr.length;) {
+    result.push(arr.slice(index, index + size));
+    index += size;
+  }
+
+  return result;
+};