K-th Smallest Prime Fraction · Coding Interview Practice

K-th Smallest Prime FractionGiven a sorted array of 1 and distinct primes, consider every fraction arr[i] / arr[j] with i < j. Return the kth smallest fraction as [numerator, denominator].Constraints

2 <= arr.length <= 1000

arr[0] == 1 and the rest are distinct primes in ascending order

1 <= k <= arr.length * (arr.length - 1) / 2

Examples

Input: arr = [1, 2, 3, 5], k = 3 Output: [2, 5]

Input: arr = [1, 7], k = 1 Output: [1, 7]

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…