Coding Interview Question | Find one/two Missing Numbers in Array | XOR application

preview_player
Показать описание

The video includes following details-
0:00-0:55 - Problem statement
0:55-1:45 - Brute Force approach
1:45-3:45 - 1 no missing using sum of elements
3:45-5:30 - 2 nos missing using sum and product
5:30-8:00 - 2 nos missing using only sum
8:00-10:10 - XOR table and properties
10:10-11:35- 1 no missing using XOR
11:35-15:05-2 nos missing using XOR

Рекомендации по теме
Комментарии
Автор

Thanks for introducing new weapon called xor.

padarthiharibabu
Автор

I found this channel today. I absolutely loved your explanation.

shwetajha
Автор

was looking for solution of missing and repeating number and this video gives the approach of that as well.

pradeepanand
Автор

similar question was asked me in the interview like :
given array of elements from 141 to 240 of an unsorted array. in this array, 2 numbers are missing ...
find those two numbers
with Max time complexity: O(N) .. N is the size of the input array.

easycode
Автор

one video with so many approaches simply great. ☺

alphonseprakash
Автор

Found great video after a long time on DS. Explanation is very good and to the point. Thanks for posting, keep going! 😃

abhijeetsoni
Автор

🥰 grt approach, another similar type ques is find one missing and one repeating number in array.

udayptp
Автор

Was looking for solution of missing repeating number and this video gives the apporach as well.

maheswarishanthi
Автор

Watch with 1.5x and skip till 00:08:00 for the best solution.

dev-skills
Автор

Well Explanation is good but if you can show us how can we implement these logic in the code it will give the viewer better understanding.

SonijiCoding
Автор

The xor concept is interesting but how can we implement in program? Explain the same in writing program or send program link if already there.

venkateshpachigulla
Автор

The moment I saw the video I could recognize her from the Google Interview video she gave which was so good!

bhawna
Автор

Nice explanation. I would not have thoughts of it

maheswarishanthi
Автор

Thank you for this video, the explanation helped solidify my understanding of XOR.

josiahdavid
Автор

I fall in problem suru m smz aa rha tha bt last tak aate aate mujhe ghar jane do wali condition aa gyi bt I appreciate ur efforts thanks

backbencher
Автор

Suppose the input array had negative elements e.g. A{1, -2, 4, -5, 6} how would you find a missing element?

j-espresso
Автор

Thank u mam nice explanation of this problem solution and again thank u for making this video..

RitikKumar-bkpj
Автор

This same solution is everywhere throughout the net, it seems like every other ds/algo youtube channel came with the same solution. How do we get the intuition to use xor? Can you provide some other problem similar to this where xor can be used so that we understand how to approach the problem better.

subrochakraborty
Автор

Thank you for the video. Would've really liked to see you implement the brute force approach and talk more about how you would figure out the missing number using hash map or vector as you didn't mention how you would keep track of which number was missing given an unsorted array.

blackmouthblackface
Автор

Can we extend your solution for finding 3 missing numbers?

AceH-oenx