kth-missing-positive-number

Kth missing positive number

Problem link

Solutions

Solution.cpp

// https://leetcode.com/problems/kth-missing-positive-number

class Solution {
 public:
  int findKthPositive(vector<int>& arr, int k) {
    int n = arr.size();
    for (int i = 0; i < n; ++i)
      if (k + i < arr[i]) return k + i;
    return k + n;
  }
};

Tags

• Suboptimal solution