Given an integer array nums that is sorted in strictly ascending order and consists of unique positive integers, along with an integer k, return the $k^{ ext{th}}$ missing number starting from the leftmost element, nums[$0$].

Constraints:

• $1 \leq$ nums.length $\leq 5 imes 10^4$

• $1 \leq$ nums[i] $\leq 10^7$

• nums is sorted in ascending order, and all the elements are unique.

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

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.