Add solution #2626

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|
+2626|[Array Reduce Transformation](./2626-array-reduce-transformation.js)|Easy|
 2627|[Debounce](./2627-debounce.js)|Medium|
 2629|[Function Composition](./2629-function-composition.js)|Easy|
 2630|[Memoize II](./2630-memoize-ii.js)|Hard|

solutions/2626-array-reduce-transformation.js

@@ -0,0 +1,33 @@
+/**
+ * 2626. Array Reduce Transformation
+ * https://leetcode.com/problems/array-reduce-transformation/
+ * Difficulty: Easy
+ *
+ * Given an integer array nums, a reducer function fn, and an initial value init, return the final
+ * result obtained by executing the fn function on each element of the array, sequentially,
+ * passing in the return value from the calculation on the preceding element.
+ *
+ * This result is achieved through the following operations: val = fn(init, nums[0]),
+ * val = fn(val, nums[1]), val = fn(val, nums[2]), ... until every element in the array has been
+ * processed. The ultimate value of val is then returned.
+ *
+ * If the length of the array is 0, the function should return init.
+ *
+ * Please solve it without using the built-in Array.reduce method.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {Function} fn
+ * @param {number} init
+ * @return {number}
+ */
+var reduce = function(nums, fn, init) {
+  let result = init;
+
+  for (let i = 0; i < nums.length; i++) {
+    result = fn(result, nums[i]);
+  }
+
+  return result;
+};