Time: 93 ms (95.28%) | Memory: 16.6 MB (10.24%) - LeetSync

Author: Vignesh010101

1276-closest-divisors/closest-divisors.py

@@ -0,0 +1,7 @@
+class Solution:
+    def closestDivisors(self, num: int) -> List[int]:
+        for i in reversed(range(1, int((num + 2) ** 0.5) + 1)):
+            if not (num + 1) % i:
+                return [i, (num + 1) // i]
+            if not (num + 2) % i:
+                return [i, (num + 2) // i]