Find the number which occurs odd number of times in an Array

Find the number which occurs odd number of times in an Array. The appearance of the number or the element or the character is odd number of times.

[@_DuongMinhLong]

nice explanation sir

[@davidcsidavidcsi]

Love it!! Finally understood!! It would be nice if you explained that in a loop, using odd ^= array[i] would do the whole operation and give the proper result... I didn't really understand that. Thanks!

[@shaileshpatil6416]

nice explanation

[@reyou7]

Thanks a lot sir, you are an amazing teacher!

[@tapanjeetroy8266]

Thank you sir.. Please provide us with its implementing algorithm and also upload more of such helpful videos

[@tomasz3925]

Thank you very much!!!!

[@RamisaAnjum]

Thank you! I should have found this channel earlier!!

[@praveenchouhan6388]

awesome explaination!!!!!!!!!!

[@abhasahu2712]

A very nice explanation. Could you please help me with the code if there are more elements occurring odd number of times?

[@yunuskocatas3879]

perfect teacher

[@jharolsalvadorrivera4464]

cool man! Thanks!

[@abhrakar3967]

Superb

[@ManojKumar-007]

Nice explanation. Would have been more good if you have explained with binary representation.

[@HarshaVardhan-jf9sd]

It can be done in log n using binarysearch

[@Vishal-nc8ju]

best teacher

[@saheb140]

What if there are multiple element with odd number of occurrence?

[@pratapsingh-le2br]

upload more video Sir please related to the tree traverse lower to higher and also upload the operator and looping when use which loop condition plz Sir

[@krishnashejul6418]

Hi Sir, Please make video to find the two numbers with odd occurrences in an unsorted array

[@jaysahu357]

nice sir

[@kito2266]

Great but what if the array contains number that greater than 10? Like 11, 13 and so on

[@sanketkumar1576]

thanks for explaning xor works like addition earlier i was confused about its working

[@aman9th]

Sanket Verma he meant that it is associative in nature

[@pkjhabihar]

aisa krne se last wali element kaise print hogi wo bhi to leader h...???

[@karan6551]

❤️❤️❤️

[@alluraiaht4770]

please explain compareTo should compare sort string

[@naziaashraf7595]

Even no ke liye kaise banaynge

[@akhileshasare]

Once you explained logic can you please give whole programme. It will be better in understanding both logic and whole programme at a time. Thank you.

[@yohanneskiros3873]

int numberOccursOddNumberOfTimes(int[] input) { int number = input[0]; for (int i = 1; i < input.length; i++) { number = number ^ input[i]; } return number; }

[@karthikp601]

This program for what for odd occuring times ????

[@Pritamdas-bg7fp]

Sir why u are not uploading videos

[@ruchirsingh3635]

plz posting some new video sir ji

[@emmaseay4068]

The indian man always know this better than anyone

[@lailasanthi7598]

4 is also occurs odd no of times

[@seemavatts3576]

4 is two times in 1attempt

[@JonasSchulteDE]

5:21 the magic moment :)

[@gurmeetchawla8362]

vivekanand ,where is the code for this? Kindly post that also.

[@tommyjason5035]

Could you please share the code using this XOR logic ?

[@banibindal]

U can check geekforgeeks

[@pavanchennur8411]

Program sir