Kth Missing Positive Number | GFG POTD | Binary Search | Java

In this video, we solve GeeksforGeeks Problem of the Day – *Kth Missing Positive Number in a Sorted Array* using Binary Search in Java.

🔹 *Problem Statement:*
You are given:
* A sorted array of distinct positive integers arr[]
* An integer k
* Your task is to find the kth positive number that is missing from the array

*Optimized Approach Used:*
*1.* Use Binary Search to find the smallest index where
missing numbers ≥ k
*2.* At any index mid,
missing = arr[mid] - mid - 1
*3.* Once the correct position is found,
*Answer = index + k*

📌 This avoids checking each missing number individually.

📌 *Time Complexity:*
* O( *log n* )

📌 *Space Complexity:*
* constant space O( *1* )

🔹 *Resources*
* *Problem Link:* https://www.geeksforgeeks.org/problems/kth-missing-positive-number-in-a-sorted-array/1
* *Code Link:* https://github.com/sibasundarj8/java-DSA/blob/main/BinarySearch/Searching_Kth_Missing_Positive_Number_in_a_Sorted_Array.java

👉 This problem is a classic application of binary search on answer and is frequently asked in coding interviews.

👍 *Like* | 💬 *Comment* | 🔔 *Subscribe* for daily GFG POTD solutions in Java

#gfgpotd #geeksforgeekspotd #gfgproblemoftheday
#kthmissingnumber #binarysearch #sortedarray
#javadsa #dsainjava #interviewpreparation
#codinginterview #competitiveprogramming
#dailydsapractice #java #gfgpractice

Видео Kth Missing Positive Number | GFG POTD | Binary Search | Java канала The Optimal Approach