Available question text
Given a sorted array of unique primes (starting with 1), find the k-th smallest fraction arr[i]/arr[j] (with i<j) among all pairs; the challenge is to rank these O(n^2) fractions without enumerating them, typically solved via a value-based binary search with two-pointer counting or by using a best-first (min-heap) generation of candidate fractions.
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 786. K-th Smallest Prime Fraction
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source