Available question text
Given num, find two integers whose product equals either num+1 or num+2 and whose absolute difference is minimal, and return that factor pair. The typical approach is to search for divisors near the square root of num+1 and num+2 (num up to 1e9).
Related questions
Continue with questions that share topics or the same question type.
- 3Sum Closest
Coding · Array · Sorting · Two Pointers
- Closest Binary Search Tree Value
Coding · Binary Search · Binary Search Tree · Binary Tree
- Closest Binary Search Tree Value II
Coding · Binary Search Tree · Binary Tree · Depth-First Search
- Closest Dessert Cost
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1362. Closest Divisors
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source