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.
We'll cover the following...
We'll cover the following...
Statement
You are given a sorted array of unique integers, arr, which includes the number
For every index arr.length, you can form a fraction by taking the number at index