Available question text
Compute the sum of floor(nums[i] / nums[j]) over all index pairs (mod 10^9+7). The challenge is to avoid O(n^2) by using value frequency/count arrays and iterating over possible quotient ranges or multiples (values and n up to 10^5) to accumulate contributions efficiently.
Related questions
Continue with questions that share topics or the same question type.
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 1862. Sum of Floored Pairs
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source