Add solution #1558

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,366 LeetCode solutions in JavaScript
+# 1,367 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1189,6 +1189,7 @@
 1553|[Minimum Number of Days to Eat N Oranges](./solutions/1553-minimum-number-of-days-to-eat-n-oranges.js)|Hard|
 1556|[Thousand Separator](./solutions/1556-thousand-separator.js)|Easy|
 1557|[Minimum Number of Vertices to Reach All Nodes](./solutions/1557-minimum-number-of-vertices-to-reach-all-nodes.js)|Medium|
+1558|[Minimum Numbers of Function Calls to Make Target Array](./solutions/1558-minimum-numbers-of-function-calls-to-make-target-array.js)|Medium|
 1566|[Detect Pattern of Length M Repeated K or More Times](./solutions/1566-detect-pattern-of-length-m-repeated-k-or-more-times.js)|Easy|
 1576|[Replace All ?'s to Avoid Consecutive Repeating Characters](./solutions/1576-replace-all-s-to-avoid-consecutive-repeating-characters.js)|Medium|
 1598|[Crawler Log Folder](./solutions/1598-crawler-log-folder.js)|Easy|

solutions/1558-minimum-numbers-of-function-calls-to-make-target-array.js

@@ -0,0 +1,43 @@
+/**
+ * 1558. Minimum Numbers of Function Calls to Make Target Array
+ * https://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array/
+ * Difficulty: Medium
+ *
+ * You are given an integer array nums. You have an integer array arr of the same length with all
+ * values set to 0 initially. You also have the following modify function.
+ *
+ * You want to use the modify function to convert arr to nums using the minimum number of calls.
+ *
+ * Return the minimum number of function calls to make nums from arr.
+ *
+ * The test cases are generated so that the answer fits in a 32-bit signed integer.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var minOperations = function(nums) {
+  let totalOperations = 0;
+  let maxDivisions = 0;
+
+  for (let num of nums) {
+    let currentDivisions = 0;
+    let increments = 0;
+
+    while (num > 0) {
+      if (num % 2 === 1) {
+        increments++;
+        num--;
+      } else {
+        currentDivisions++;
+        num /= 2;
+      }
+    }
+
+    totalOperations += increments;
+    maxDivisions = Math.max(maxDivisions, currentDivisions);
+  }
+
+  return totalOperations + maxDivisions;
+};