Add solution #1362

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,255 LeetCode solutions in JavaScript
+# 1,256 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1036,6 +1036,7 @@
 1359|[Count All Valid Pickup and Delivery Options](./solutions/1359-count-all-valid-pickup-and-delivery-options.js)|Hard|
 1360|[Number of Days Between Two Dates](./solutions/1360-number-of-days-between-two-dates.js)|Easy|
 1361|[Validate Binary Tree Nodes](./solutions/1361-validate-binary-tree-nodes.js)|Medium|
+1362|[Closest Divisors](./solutions/1362-closest-divisors.js)|Medium|
 1365|[How Many Numbers Are Smaller Than the Current Number](./solutions/1365-how-many-numbers-are-smaller-than-the-current-number.js)|Easy|
 1366|[Rank Teams by Votes](./solutions/1366-rank-teams-by-votes.js)|Medium|
 1368|[Minimum Cost to Make at Least One Valid Path in a Grid](./solutions/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid.js)|Hard|

solutions/1362-closest-divisors.js

@@ -0,0 +1,39 @@
+/**
+ * 1362. Closest Divisors
+ * https://leetcode.com/problems/closest-divisors/
+ * Difficulty: Medium
+ *
+ * Given an integer num, find the closest two integers in absolute difference whose product
+ * equals num + 1 or num + 2.
+ *
+ * Return the two integers in any order.
+ */
+
+/**
+ * @param {number} num
+ * @return {number[]}
+ */
+function closestDivisors(num) {
+  const pair1 = findClosestPair(num + 1);
+  const pair2 = findClosestPair(num + 2);
+
+  return Math.abs(pair1[1] - pair1[0]) <= Math.abs(pair2[1] - pair2[0]) ? pair1 : pair2;
+
+  function findClosestPair(target) {
+    let minDifference = Infinity;
+    let pair = [];
+
+    for (let divisor = 1; divisor <= Math.sqrt(target); divisor++) {
+      if (target % divisor === 0) {
+        const complement = target / divisor;
+        const difference = Math.abs(complement - divisor);
+        if (difference < minDifference) {
+          minDifference = difference;
+          pair = [divisor, complement];
+        }
+      }
+    }
+
+    return pair;
+  }
+}