Search⌘ K
AI Features

Solution: Kth Smallest Prime Fraction

Solution: Kth Smallest Prime Fraction gives a sorted array containing 1 and primes; return the numerator and denominator of the kth smallest fraction using earlier elements over later ones.

Statement

You are given a sorted array of unique integers, arr, which includes the number 11 and other prime numbers. You are also given an integer kk.

For every index ii and jj where 0≤i<j<0 \leq i < j < arr.length, you can form a fraction by taking the number at index ii as the numerator and the number at index jj ...