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

Chapters:
00:00 - Intro
00:44 - Problem Statement
03:47 - Thought process
09:02 - One more test case
12:26 - Using Binary Search
13:52 - Dry-run of Code
15:04 - A special case
17:13 - Final Thoughts

📚 Links to topics I talk about in the video:

📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

#leetcode #programming #interview

[Servant-HKM-Pune]

What a simple and easy explanation. Better than striver's video.

[motupatlu-ttfe]

The most underrated channel with the best video explanations🙂🙂👍👍

[Iam_Srikanth_]

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

[shreyak]

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

[Satya-gt]

Whatever problems Nikhil solves, he makes sure that the concept is explained clearly. 😄

[thalap_-]

Thanks for making the video despite the views

[vipul]

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.

[sumangupta]

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?

[bhudevsahu]

I wish you had done a dry run of the example with the code. The explanation helped but the code logic doesn't exactly follow your explanation.

[adityaarya]

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

[t.jvlogs]

Who came here after not understanding strivers brute force 😂

[jayeshpatil]

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