Kth Missing Positive Number (LeetCode 1539) | Full Solution with intuition, animations and visuals

[@Iam_Srikanth_009]

Really this guy needs a lot of support.... Thank you for explaining this problem and making me to understand it 😊. Really hats off for your explanation

[@nikoo28]

Thanks for all the support and motivation

[@shreyak23]

Though I'm solving LeetCode problems using JavaScript, but can understand it in Java too. Thank you for such great explanations.

[@thalap_74-]

Thanks for making the video despite the views

[@DharaniChavala]

very nice and clear explanation.

[@vipul20465]

Hey Nikhil, Thanks for the awesome explanation. I attempted to come up with a brute-force solution as per the explanation provided in the video to locate the kth positive element, but unfortunately, it's not passing all of the test cases. Could you please share the brute-force implementation of this problem.

[@rambhaktuchihaobito7987]

Thank you ..sir❤❤

[@sumangupta5292]

The explanation is excellent. However I have 2 questions - 1. Why we take right as arr.length and not arr.length-1 , 2. How did we arrive at return left + k?

[@nikoo28]

1. to get a mid value, you are actually looking at the number of elements, and not the index. Thus, right will be the actual array length. 2. adding k to the 'left' will actually land you at the missing number.

[@Adeetisharma-nu8jg]

thankyou so much

[@unknownman1]

Thanks !

[@gpraneeth7693]

Helped a lot

[@subee128]

Thank you very much

[@adityaarya3249]

Why didn't you take right = arr.length -1;

[@sumangupta5292]

I have the same question. Generally we take right pointer as arr.length-1

[@je2587]

@@sumangupta5292 not sure if this answers your question but since we do while(left < right), we need to do right=arr.length before. If you go with arr.length-1, you would go with while(left

[@sksabir8063]

🤩

[@jayeshpatil5757]

19:04, 10 July , watching. Red cloth washed at 18:53,10 July.