Kth Missing Positive Number || Binary Search || 2-Pointers || Leetcode-1539

[@ARYANMITTAL]

Code: leetcode.com/problems/kth-missing-positive-number/solutions/3262503/white-board-solution-binary-search-2-pointers-video-solution-intution/?orderBy=most_votes

[@study-yd6es]

Amazing Content!!!!

[@rutikbodke4036]

Great explanation

[@devanshshrimali2125]

great explianation

[@dixitnakhva6181]

Thank you sir

[@aryangupta3257]

Not working with testcase k =1 and array {32,59,77} ans should be 33 according to gfg.

[@AndrijaMilikic]

THANKS BROOOOOOOOOOOOOOOOOOOO

[@abhaykumarsingh3884]

public int findKthPositive(int[] arr, int k) { //brute force(Two pointer)(O(n)) int num=1; int count=0; for(int i=0;i

[@yashwants18]

What if k > last element of arr?

[@rakibulhasanrumon4884]

why there is l+k at the last, and why not r+k?

[@ARYANMITTAL]

Both are possible and will give correct result as l==r , hope that solves the doubt :)

[@sandeeparn]

Why at last l+k and not r+k

[@ARYANMITTAL]

Both are possible and will give correct result as l==r , hope that solves the doubt :)