Majority Element | Leetcode 169 |Moore's voting algorithm | Top 150 interview question series

Top 150 interview question series
Majority Element
Leetcode problem number 169
JAVA interview programming playlist:
• Interview Programming ...
Git Repo:
github.com/Technosagelearning...

[@sriramongrind]

Sister the way you explaining blows my mind don't stop teaching you are so good !

[@manishjeena6325]

I appreciate your way of explaining.....thank you❤🙏

[@JaiShriiiiRam]

Thank you so much mam, for such simple and accurate explaination.

[@adolfocarrillo248]

But the algorithm is limited to work only if two different elements appears on the array, for more than 2 different elements it won't work. It's kind of restricted functionality.

[@sppatro9477]

Yes so then what's the solution?

[@sppatro9477]

If you know then please reply

[@AnjaliYadav-qv4sb]

it is very useful...thank you

[@nazim4525]

Awesome 👍👍👍👍 mam

[@iam_phani]

A big shout out to you Mam. You made topics clear, simple and explanations were on point. A big thank you for all your efforts. If time permits, I humbly request you to please continue the 150 interview leetcode problems.

[@TechnosageLearning]

Hey..i will continue the series very soon..stay tuned

[@Harshal-dk2kr]

will there will be only 2 types of elements in the array ... suppose [1,1,2,3,0,1] here it is 4 diffetnet element ...so what will be output for it.. and 2 or 3 will not try to decrese their point instead of against 1 ..

[@AbhayKumar-xp3dy]

Hey these videos are really helping me .... can you please complete these 150 sheets playlist , turn out to best resource for me till now. please🙂🙂

[@ahmadfarhadghafoori3369]

This is only works for these two examples. If the the elements of the array getting longer it won't work.

[@krutarthpatel7373]

best

[@purushothamanr.bemechanica3288]

good

[@Nonsense675]

Hi I'm really grateful for this highly self explanatory piece, one point that I am in need of clarification: the input is supposed to be 'non-zero', , is that correct please ?

[@umeshkumarmahato5234]

please continue this series

[@TechnosageLearning]

Sure 😊

[@himanshupokhariya9125]

[6,5,5] on that test case answer will be would could you tell me why ??

[@mayankarora5345]

Mam,given example me '3' ka count 1 ayya h lekin apne ko more than '1'(n/2) chaiye tha , apne ko pta h ki '3' total 2 times h lekin question m kese pta chla ki 3 more than 1(n/2) times h , kioki last m to count '1' hi bachha tha, mtlb usne compare kese kiya length se?

[@nazim4525]

Please mam you continue solve LEETCODE questions

[@TechnosageLearning]

Hi..Will upload videos very soon..

[@nazim4525]

@@TechnosageLearning One day your youtube channel will increase a lot of subscribers

[@TechnosageLearning]

Thank you🙏

[@mdayazalam3132]

Mam please upload the Leetcode question no 238 Product of Array Except Self

[@ujjwaldas2302]

you dint verified the case that majority element should be more the n/2 ????

[@Bagulaff]

Sir muje VMware me job Leni hai to uske liye kya kya karna padega

[@sgautam6468]

The solution does not work for different arrays.

[@yash_14h]

Mam why there are only three types of numbers.?? In array 😢

[@TechnosageLearning]

That is only an example..you can take any type of numbers

[@GauravRaj-bi9kg]

why u have stop the series you may complete it all plzzzzzzzzzz

[@TechnosageLearning]

Hi Starting very soon..working on it..Please stay tuned

[@GauravRaj-bi9kg]

@@TechnosageLearning as soon as possible am waiting

[@soumyabrajwasi845]

it fails when arr is - 3,3,4

[@TechnosageLearning]

No its not failing ..in this case,majority element is 3 and output is also 3..you can try the code from git repo..You might be missing something

[@niggaswildin]

I'm a beginner. After what topics should i learn time and space complexity maam, also i wrote this code and got the answer: class Solution { public int majorityElement(int[] nums) { int n = nums.length; for(int i=0;i