Add solution #2625

Author: JoshCrozier

README.md

@@ -383,6 +383,7 @@
 2621|[Sleep](./2621-sleep.js)|Easy|
 2622|[Cache With Time Limit](./2622-cache-with-time-limit.js)|Medium|
 2623|[Memoize](./2623-memoize.js)|Medium|
+2625|[Flatten Deeply Nested Array](./2625-flatten-deeply-nested-array.js)|Medium|
 2626|[Array Reduce Transformation](./2626-array-reduce-transformation.js)|Easy|
 2627|[Debounce](./2627-debounce.js)|Medium|
 2629|[Function Composition](./2629-function-composition.js)|Easy|

solutions/2625-flatten-deeply-nested-array.js

@@ -0,0 +1,31 @@
+/**
+ * 2625. Flatten Deeply Nested Array
+ * https://leetcode.com/problems/flatten-deeply-nested-array/
+ * Difficulty: Medium
+ *
+ * Given a multi-dimensional array arr and a depth n, return a flattened version of that array.
+ *
+ * A multi-dimensional array is a recursive data structure that contains integers or other
+ * multi-dimensional arrays.
+ *
+ * A flattened array is a version of that array with some or all of the sub-arrays removed and
+ * replaced with the actual elements in that sub-array. This flattening operation should only
+ * be done if the current depth of nesting is less than n. The depth of the elements in the
+ * first array are considered to be 0.
+ *
+ * Please solve it without the built-in Array.flat method.
+ */
+
+/**
+ * @param {Array} arr
+ * @param {number} depth
+ * @return {Array}
+ */
+var flat = function(arr, n) {
+  if (n === 0) return arr;
+  const result = [];
+  for (let i = 0; i < arr.length; i++) {
+    result.push(...(Array.isArray(arr[i]) ? flat(arr[i], n - 1) : [arr[i]]));
+  }
+  return result;
+};