Find Missing and Repeating Number | 5 Approaches with Full Code in Comments | Bit Manipulation Array
Vložit
- čas přidán 5. 07. 2024
- Timestamps:
0:00 Approach 1 Sorting
2:00 Approach 2 Count Tracker
3:15 Approach 3 Summation Trick
7:45 Approach 4 Sign Trick
10:40 Code of Approach 4
13:20 Approach 5 Bit Manipulation XOR
17:25 Code of Approach 5
Connect with me on LinkedIn : / alisha-parveen-80579850
Check out our other playlists:
Dynamic Programming:
• Dynamic Programming
Trees:
• Trees
Heaps and Maps:
• Heaps and Maps
Arrays and Maths:
• Arrays and Maths
Bit Manipulation:
• Bit Manipulation
Greedy Algorithms:
• Greedy Algorithms
Sorting and Searching:
• Sorting and Searching
Strings:
• Strings
Linked Lists:
• Linked Lists
Stack and Queues:
• Stacks and Queues
Two Pointers:
• Two pointers
Graphs, BFS, DFS:
• Graphs, DFS, BFS
Backtracking:
• Backtracking
Non- DSA playlists:
Probability:
• Probability
SQL-Basic Join functions:
• SQL - Basic JOIN Funct...
SQL-Basic Aggregate functions:
• SQL-Basic Aggregate Fu...
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.
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
You explained the XOR one the best I saw on YT
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 !!
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
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++
thank u i literally watched 2 times to catch your speed amazing work
Thank you. ur explanation is awesome
Exception Explanation 🔥
Thank you alisha👍🏽
Thank you so much.
Amazing explanation ma'am 👌👌😊👍
sign trick in Approach 3 is wowww!
😊 thanks ma'am
Top notch explanation💯🔥
u deserve 100k subscribers
Thanks a lot maam
This is most Underated Channel
Xor explaining is awesome
Thanks diii
Damn good yrr... 👍
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??
how can we get multiple approaches with any problem ???? Unbelievable 🙌🙌🙌😵
You are too good 😍
Yeah she is good😂😂
👌👌👌
Didn't get the intuition behind xor approach
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
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?