A Google Interview Question. # Digital Design

A google Interview question with simple concept is explained in this video.

If you have any doubts in any topic in digital electronics please leave a comment down below , I WILL RESPOND BACK .

source : Nir Dahan (Asic Digital Design)

Thanks for watching ,PLEASE DO SUBSCRIBE IT WILL HELP ME A LOT to produce more good content for you

[cgvedant]

Even commutative property is required to prove that the operation would give the correct answer right?
Is there any operation has identity, self-inverse, and associative but not commutative 🤔

[saranshchoudhary]

Hi Karthik! Since we are only interested in finding the number which occurs once, I think using a series of XOR operations alone should suffice. My understanding is that a counter (or any sequential for that matter) won't be needed - this is very similar to a binary to gray conversion, where you shift the bits and keep doing XOR.

Also, the problem statement does not put a constraint on the max size of the elements which the array can have, so attention has to be paid here as well.

[cernammahesh]

Short and informative video. Good job 👍

[shivakumarpujuri]

Superb question yar... Extraordinary work👍
Hoping to have more mind puzzling questions in further videos.

[oviya.n]

pls put google interview questions like these

[swapnilvhatkar]

if each digit is represented using 4 bits, wont we need 4 xor to compare the data?

[oviya.n]

pls do not stop posting video like these

[lavanyabalasubramanian]

Hey! Great video! Excellent animations!! Keep doing the great work!
Also, where can we find these kind of questions for Digital design and verification interviews? Is there something like leetcode used by a lot of CS students?

[MrKnaha]

I have 12 years career gap can i get a job in embedded system or vlsi after doing a course

[kvssumakar]

Cool video, and nice style of animation

But, You are not taking Array to store data in account. Also instead of taking a new register, you can reuse one of data register.

Also is A^B^C == A^C^B ?

[YaduS-ng]

Can someone share, how this code will be in Verilog?
I tried, but unable to do it without using modulus operator (%). My understanding is that mod operator is not synthesizable or need a very complex hardware. Correct me if i am wrong