Given a strictly increasing array arr of positive integers and a positive integer k, return the $k^{th}$ positive integer that is missing from arr.

Constraints:

• $1 \leq$ arr.length $\leq 10^3$

• $1 \leq$ arr[i] $\leq 10^3$

• $1 \leq$ k $\leq 10^3$

• arr[i] $<$ arr[j] for $1 \leq$ i $<$ j $\leq$ arr.length

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.