Majority Element in an array (Algorithm)

Find the majority element in an array. Number of occurrences of that element must be greater than half of the size of the array. There can be atmost one majority element in the array.

[Bakepichai]

Your videos are good. But this video doesn't have any meaning content as the actual algorithm is not discussed.

[Endlessvoidsutidos]

you should show edge case where the timelimit for run requires an optimized solution rather than a brute force run through every element and just add to the hash table also you should show a coded version of this in use i would recommend javascript

[akhilvenkat]

Can you explain algorithm for travelling Salesman problem?

[resourceengine]

hello sir,
I loved ur videos..
could you please do a code trace out of Dijkstra .. algorithm for finding shortest path

[maruthisaikumar]

Sir please explain how to print all subsets of a given set

[varunnarayanan]

Sir here you should have discussed Boyer Moore's algorithm.

[SuiGio]

Hello and thanks for your tutorial! I would like to know, what is the worst case complexity for this algorithm?

[mdabutorabkhan]

You should discuss more, and write the code also.

[abhaybhardwaj]

#Please sir # kindly also give the program by using 1d and 2d array in Java script.

[sanjaysingh]

sir plz solve full algorithm as for beginners it would be more fruitful.

[amreenmazhar]

hi 2 occurs 3 times in the second example

[Gothfen]

Hello! I love your videos and I've learn a lot with them :), could you please make a video explaining self balancing binary search trees?

[di]

This is stupid!! I thought he was explaining the complex algorithm. Naive algorithm anyone can look up online.