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
4 ай бұрын
Thanks for all the support and motivation
@shreyak23
21 күн бұрын
Though I'm solving LeetCode problems using JavaScript, but can understand it in Java too. Thank you for such great explanations.
@rambhaktuchihaobito7987
28 күн бұрын
Thank you ..sir❤❤
@DharaniChavala
Ай бұрын
very nice and clear explanation.
@sumangupta5292
2 ай бұрын
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
2 ай бұрын
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.
@vipul20465
3 ай бұрын
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.
@unknownman1
4 ай бұрын
Thanks !
@Adeetisharma-nu8jg
Ай бұрын
thankyou so much
@gpraneeth7693
3 ай бұрын
Helped a lot
@subee128
4 ай бұрын
Thank you very much
@sksabir8063
Ай бұрын
🤩
@adityaarya3249
3 ай бұрын
Why didn't you take right = arr.length -1;
@sumangupta5292
2 ай бұрын
I have the same question. Generally we take right pointer as arr.length-1
@je2587
2 ай бұрын
@@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
@jayeshpatil5757
Ай бұрын
19:04, 10 July , watching. Red cloth washed at 18:53,10 July.
Пікірлер: 17