# Kth Missing Positive Number Leetcode Solution  Difficulty Level Easy
algorithms Array coding Hashing Interview interviewprep LeetCode LeetCodeSolutions

## Problem statement  In the problem “Kth Missing Positive Number” we are given an array arr, which is sorted in strictly increasing order and a number k.

Our task is to find out the Kth positive missing number in the array.

### Example

`arr = [1,2,3,4], k = 2`
`6`

Explanation: As in the given array, the first missing number is 5 and the second missing number is 6.  So, the answer is 6.

## Brute Force Approach for Kth Missing Positive Number Leetcode Solution  The brute force approach to solve this problem is as follows:

1. Traverse the array.
2. Every time we will calculate the number of missing numbers.
3. if the number of missing positive numbers is greater than or equal to k then we will return i+k.
4. After the complete traversal of the array if the number of missing elements is less than k then we will return the size of the array+k.
Fizz Buzz Leetcode

### C++ code for Kth Missing Positive Number

```#include <bits/stdc++.h>
using namespace std;
int findKthPositive(vector<int>& arr, int k) {
for(int i=0;i<arr.size();i++)
{
int x=arr[i]-(i+1);
if(x>=k)
return i+k;
}
return arr.size()+k;
}
int main()
{
vector<int> arr = {1,2,3,4};
int k=2;
int ans=findKthPositive(arr,k);
cout<<ans<<endl;
return 0;
}```
`6`

### Java code for Kth Missing Positive Number

```import java.util.Arrays;
import java.util.Set ;
import java.util.HashSet;
public class Tutorialcup {
public static int findKthPositive(int[] arr, int k) {
for(int i=0;i<arr.length;i++)
{
int x=arr[i]-(i+1);
if(x>=k)
return i+k;
}
return arr.length+k;
}
public static void main(String[] args) {
int [] arr = {1,2,3,4};
int k=2;
int ans=findKthPositive(arr,k);
System.out.println(ans);
}
}```
`6`

## Complexity Analysis of Kth Missing Positive Number Leetcode Solution  ### Time complexity

The time complexity of the above code is O(n) because we are using a linear search that takes O(n) time in the worst case. Here n is the length of the given array.

### Space complexity

The space complexity of the above code is O(1) because we are using only a variable to store answer.

## Binary Search Approach for Kth Missing Positive Number Leetcode Solution  The time complexity of the above algorithm is O(n) because we may need to traverse the complete array in the worst case. We can improve the time complexity of the solution using a binary search in place of linear search.

1. let’s first define the range of our search for binary search. So start will be index 0 and end will be the last index of the given array.
2. We will find the mid index then we will check if the number of missing positive numbers is less than k:
1. then start will become mid+1.
2. else end will become mid.
3. return end+k.
Symmetric Tree

### C++ code for Kth Missing Positive Number

```#include <bits/stdc++.h>
using namespace std;
int findKthPositive(vector<int>& A, int k) {
int l = 0, r = A.size(), m;
while (l < r) {
m = (l + r) / 2;
if (A[m] - 1 - m < k)
l = m + 1;
else
r = m;
}
return l + k;
}
int main()
{
vector<int> arr = {1,2,3,4};
int k=2;
int ans=findKthPositive(arr,k);
cout<<ans<<endl;
return 0;
}```
`6`

### Java code for Kth Missing Positive Number

```import java.util.Arrays;
import java.util.Set ;
import java.util.HashSet;
public class Tutorialcup {
public static int findKthPositive(int[] A, int k) {
int l = 0, r = A.length, m;
while (l < r) {
m = (l + r) / 2;
if (A[m] - 1 - m < k)
l = m + 1;
else
r = m;
}
return l + k;
}
public static void main(String[] args) {
int [] arr = {1,2,3,4};
int k=2;
int ans=findKthPositive(arr,k);
System.out.println(ans);
}
}```
`6`

## Complexity Analysis of Kth Missing Positive Number Leetcode Solution  ### Time complexity

The time complexity of the above code is O(log n) because we are using a binary search that takes O(logn) time in the worst case. Here n is the length of the given array.

### Space complexity

The space complexity of the above code is O(1) because we are using only a variable to store answer.

References