Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 786. K-th Smallest Prime Fraction
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.