Available question text
Find the minimum positive integer divisor d such that the sum of ceil(nums[i]/d) over all elements is ≤ threshold. The sum is monotone decreasing in d, so this is a typical “binary search on the answer” problem over d in [1, max(nums)].
Related questions
Continue with questions that share topics or the same question type.
- Find the City With the Smallest Number of Neighbors at a Threshold Distance
Coding
- Find All Possible Recipes from Given Supplies
Coding · Array · Directed Acyclic Graph · Graph Theory
- Find Array Given Subset Sums
Coding
- Find Beautiful Indices in the Given Array I
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 1283. Find the Smallest Divisor Given a Threshold
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source