Your XOR explanation is the best on youtube. I randomly chose to see this video on search results and now I am surprised by such a beautiful explanation.
Watching after tons of videos in this problem. Finally i understood this now . Thank you very much. And to be honest , you explained this much better than striver.
Just came back to this video to say thank you for making this, approach 2 and 4 are my preferred ways of solving this and are perfect. Thanks for your help
In XOR, how can we sure that the diffrentiating bit will lead us to the answer. I have understood your point for putting the values in 2 different buckets accordingly but how diffrentiating bit is leading us to the solution 3^4 = 1 so what??
The video is nice but I suggest that you avoid repeating same line multiple times. For e.g "xor of 2 and 3 is 1" you have repeated this thrice ....this makes the video unnecessarily long
I hate Math solution's so damn much. They are so unintuitive to come up with during an interview especially if you never seen this problem before. I'm gonna stick to the counts tracker solution and the sign trick solution, thank you
Using Sign Trick:
int* ans;
// ans[0]->repeating
// ans[1]->missing
for(int i=0;i 1
if(arr[x]repeating
ans[1] = 0; //bit not set //->missing
for(int i=0;i
Your XOR explanation is the best on youtube. I randomly chose to see this video on search results and now I am surprised by such a beautiful explanation.
You explained the XOR one the best I saw on YT
I found a highly underrated GEM
You are way better than so called DSA-Gurus
Your channel is so underrated! Thanks for the alternate approaches, great explanation.
I personally recommend your videos to all my coder friends as your ability of making people understand the solution is amazing
Watching after tons of videos in this problem. Finally i understood this now . Thank you very much. And to be honest , you explained this much better than striver.
Love you Alisha, you are just the best.
Literally nowhere on youtube could i find any clear solution. But you saved us.
Thanks Shivangi, glad you found the solution helpful !!
you're one of the rare person who solves code in C , thats really wonderful , looking forward to more of your videos
she was using c++
Just came back to this video to say thank you for making this, approach 2 and 4 are my preferred ways of solving this and are perfect. Thanks for your help
Thank you ! Glad I could help
Amazing explanation ma'am 👌👌😊👍
u deserve 100k subscribers
Xor explaining is awesome
Can you share mathematical approach like how should I code it ?? Btw amazing knowledge 👍🏻
thank u i literally watched 2 times to catch your speed amazing work
In XOR, how can we sure that the diffrentiating bit will lead us to the answer. I have understood your point for putting the values in 2 different buckets accordingly but how diffrentiating bit is leading us to the solution
3^4 = 1 so what??
This is most Underated Channel
sign trick in Approach 3 is wowww!
Exception Explanation 🔥
Thank you. ur explanation is awesome
You are too good 😍
Yeah she is good😂😂
Thank you so much.
😊 thanks ma'am
how can we get multiple approaches with any problem ???? Unbelievable 🙌🙌🙌😵
Didn't get the intuition behind xor approach
Thank you alisha👍🏽
Thanks a lot maam
Damn good yrr... 👍
The video is nice but I suggest that you avoid repeating same line multiple times. For e.g "xor of 2 and 3 is 1" you have repeated this thrice ....this makes the video unnecessarily long
👌👌👌
Thanks diii
striver really confuses a lot
I hate Math solution's so damn much. They are so unintuitive to come up with during an interview especially if you never seen this problem before.
I'm gonna stick to the counts tracker solution and the sign trick solution, thank you
You are a metallurgical engineering ,then how are so proficient in coding,huh?
Top notch explanation💯🔥