Leetcode Problem 1362. Closest Divisors

1362. Closest Divisors

Leetcode Solutions

Iterative Approach with Square Root Optimization

  1. Calculate the square root of num + 2 and store it in a variable sqrtNumPlusTwo.
  2. Iterate i from sqrtNumPlusTwo down to 1. a. If num + 1 is divisible by i, return [i, (num + 1) / i] as they are the closest divisors for num + 1. b. If num + 2 is divisible by i, return [i, (num + 2) / i] as they are the closest divisors for num + 2.
  3. If no divisors are found (which should not happen), return an empty array.
UML Thumbnail

Brute Force Approach with Incremental Search

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...