Feature #9: Kth Missing Gene

Description

A planet has n genes, numbered 1 to n. Every species on the planet has a subset of these genes in its DNA sequence. For a given species’ DNA, gene_A, we want to find the $k^{th}$ missing gene in a sorted order. The given DNA sequence will be sorted in strictly increasing order.

Constraints

• 1 <= gene_A[i] <= 1000
• 1<= k <= 1000
• gene_A[i] <= gene_A[j] for 1 <= i < j <= gene_A.length

The following examples may clarify this problem:

Solution

Our input is sorted in ascending order. We can use this fact and try to solve this problem using binary search. However, we need to find the number of missing genes that come before a given gene in the DNA gene_A in order to use the binary search algorithm. To find the number of missing genes, we will compare our input array, gene_A, with an array that has no missing genes.

Suppose that the input array, ...