Majority Element | Moore's Voting Algorithm| O(N) Time complexity and O(1) Space Complexity Solution

[@tanvisharma6879]

I cannot thank this channel and the instructor enough for making my DSA concepts so clear. Thanks a lot:))

[@HelloWorldbyprince]

You made my day ❤️❤️

[@alim241081]

You are junior than me but you are superb

[@Vivekanandfanspage]

dil se shukriya sir , batana ka tarika wakai bahut damdar hai.

[@HelloWorldbyprince]

Dil se shukriya...itna dil se bolne ke liye

[@DHIRAJKUMAR-je4ql]

a lot of appreciation for your work from my side bcz i am in learning stage of dsa thank u so much.

[@HelloWorldbyprince]

Your welcome buddy You are not alone just stick with us and please share my channel with the needy students who wants the content like this

[@pulkitmethaniya6471]

bhai kya sai explanation kiya yr point to point itni saari video dekhne ke baad smjh aa gaya tumse :)

[@paridhijain2313]

Apka hindi explaination saare concepts samja deta he aasani se. Thank you bhaiya for such useful content. Keep making such videos. Subscribed already.

[@HelloWorldbyprince]

Thanks for this comments 🙂 Sure I will

[@BMEFaisal_khan]

sir,great explanation

[@ritikraj1086]

Amazingly explained!!! Glad to find your channel SUBSCRIBED

[@HelloWorldbyprince]

Thanks yaar Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@beinghappy9223]

Best explanation of Voting Algorithm available on You Tube ❤🙏

[@HelloWorldbyprince]

Wow, thank you!

[@mridul1075]

bhai bhai kya explanation hai yrr, gazab...take u forward wale ne to english jhadke salle ne confuse kr dia tha, thanks bro

[@HelloWorldbyprince]

😁😁 No worry Prince is here

[@Karan-sir]

Your videos are really very simple and helpful and the way you teach I am your fan brother thank you so much for creating these videos.

[@HelloWorldbyprince]

Thanks a lot for your support ❤️

[@mokshdadave5077]

superb explaination sir!!!.........you made it crystal clear.

[@vitaminprotein2217]

2nd approach best tc->o(1) worst o(nlogn) //hashing unordered_mapumap; int maxi=-1e9; int key=-1; for(auto x:nums)umap[x]++; //return the most freq element for(auto x:umap){ if(x.second>maxi){ maxi=x.second; if(x.second>nums.size()/2)key=x.first; } } return key;

[@SruthiPrasannakumar]

Voting algorithm best video on youtube

[@ayushijindal4898]

Beautifully Explained 👏 Keep Explaining😇

[@aashishanand6695]

Bhaiya the way u explain is🔥🔥🔥🔥🔥

[@knowsbetter4113]

Finally got this algo I like how you split solutions into steps . thank you bhaiya

[@HelloWorldbyprince]

Thanks a lot buddy please share this video so that others can also get benefits from this

[@nunsavathnaveenkumar9219]

sir, your explanation is too good for understanding ,thank you

[@HelloWorldbyprince]

I am glad .. I found one more new subscriber And from you I hope I got 💯 more subscribers

[@shyampandey1862]

Really crestal clear explanation.

[@HelloWorldbyprince]

Thanks a ton shyam keep learning yaar Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@startupmindset7597]

bro your explaination is best on youtube .....

[@HelloWorldbyprince]

Thanks a lot Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@subhranilbagchi580]

your explantions are awsome man

[@HelloWorldbyprince]

Thanks a lot 😀

[@letsgoswe]

It was good and easy explanation. But here's something I want to talk bout on the naive approach. Don't you think the if condition in inner loop is wrong? if we are checking inside the inner loop like this : if count n /2 then return arr[i]. and we will return -1 in the outside of the main loop.

[@deepanshugarg8411]

thanks a lot sir !! , really i watched almost all the video , your explantion is really nice

[@HelloWorldbyprince]

You are most welcome

[@BMEFaisal_khan]

great ,Explanation sir

[@HelloWorldbyprince]

Thanks 😊😊

[@biswajitsamal2408]

Sir, as we studied counting sort there also we are actually storing the frequency can't we use counting sort to solve this problem.

[@HelloWorldbyprince]

I think on your solution we have to maintain some auxiliary space which takes O( N ) space complexity .... And we have to solve in O ( 1) space complexity

[@Man_of_Culture.]

Bro through this method he is not using extra space . That's the beauty of this algorithm.

[@Crazy-is3yx]

Its really helpful...😃thanks..sir

[@HelloWorldbyprince]

Most welcome

[@sakshisingh3851]

Best explanation ever!!!!!

[@HelloWorldbyprince]

glad u liked it

[@ankushladani496]

Thank You Bhaiya for this....

[@leepakshiyadav1643]

Brilliant explaination 👏👏

[@HelloWorldbyprince]

Thanks Leepakshi Please , if possible then share this channel in your college, groups or linkedin becoz it's cost nothing to you 😀

[@deepakgaroda975]

thank you so much sir for such nice explaination

[@HelloWorldbyprince]

Keep sharing with your friends and colleagues

[@adichaudhary1861]

bhaiya mene ye question number of times kiya but kbi run nhi hua bhut video bhi dekhi aaj muje acche se smj aaya h thank u bhaiya

[@HelloWorldbyprince]

Waooo nice, chalo matlab mai thik thak samjha leta hun 😅 nice keep it up

[@aishwaryasanjayjadhav2619]

Great explanation ✨👍🏻... thankyou so much for this moores's voting algorithm ✨✨

[@HelloWorldbyprince]

You're welcome 😊

[@Suraj.18]

thank you bhaiya🥰

[@seemaalam3127]

lovely explained😍

[@HelloWorldbyprince]

Thanks a lot Seema

[@PriyankaSingh-pn8xv]

Finally understood, this algorithm... Thanks

[@HelloWorldbyprince]

keep learning Priyanka and be consistent and share my channel with your college groups that helps me a lot

[@ABHISHEKKUMAR-wc9ke]

bhaiya hashing bhi toh use kr sakte hi isme

[@HelloWorldbyprince]

Yeah u can

[@suhelali4547]

tons of thanks

[@HelloWorldbyprince]

🤩🤩

[@suhelali4547]

amazing work sir

[@HelloWorldbyprince]

Thanks 🙏

[@rahulsati5819]

nice explanation bhaiya

[@HelloWorldbyprince]

Keep learning buddy 😊

[@avinashyadav8598]

Bhaiya,ram ram🙏,, bhaiya yar unordered Map ka bhi use kar skte hai. Please reply

[@HelloWorldbyprince]

If possible then yesss

[@avinashyadav8598]

@@HelloWorldbyprince bhaiya code bhej rha hu , dhekna jara... #include #include #include using namespace std; int solve(int arr[],int k){ unordered_map mp; for(int i=0;i0) { int j=mp[a]; j++; mp[a]=j; } else { mp[a]=1; } } int vote=ceil(k/2)+1; for(auto i=mp.begin();i!=mp.end();i++) { if(i->second>=vote){ return i->first; break; } } return -1; } int main() { int ar[]={2,2,2,2,3,4,1,6,2,2};// give an array to process; int sze=sizeof ar/sizeof ar[0]; int a=solve(ar,sze); cout

[@avinashyadav8598]

@@HelloWorldbyprince arey bhaiya aab smaj gya,, thumbnail dhyan se dheka tab pta chala,,, Space:-o(1) hai, My bad Bhaiya 😂😂😂🙏🙏

[@namanshah8523]

we can also do this in O(N log N) ---we will just simply sort the array and run a for loop, which would check the element at index = i and index = i+n/2 if they both are equal, that is the majority element, and we will simply return and if there is no majority element we will simply return -1;

[@arunkumar_2107]

Thanks❤, Bhaiwa

[@Raj_Tanvar]

I was waiting for this question

[@HelloWorldbyprince]

Now, your wait is over 😅😅

[@masumali8356]

lovely.....................

[@vakilsingh5086]

isa element frequency check k lia use kr skta hai

[@CareerConnect-y1b]

Sir, brute force algorithm kya hoti h ?

[@AnkitSingh-wq2rk]

sabse basic bina dimag lagaye solution dimag mein aaye

[@CareerConnect-y1b]

@@AnkitSingh-wq2rk thanks

[@ankitsharma7541]

thanks bhai you help us a lot.

[@HelloWorldbyprince]

Thank you for your support

[@san_era]

[8,8,8,6,6,4,4] for this array the majority element will be 4 ?

[@HelloWorldbyprince]

N= 7 And N/2 = 3 And none of elements has count more than 3 Hence ans = -1

[@san_era]

@@HelloWorldbyprince Thank you Sir ,Now I got it ..I was confused

[@HelloWorldbyprince]

It happens with me also 😀😀

[@divyanshsingh490]

Sir,You know your channel is Magnetic 🧲 for me ,which attract me to solve the problem of DSA and even I solve the problem I love too see your solution... Can u please guide me how to solve the problem like u...is any other way of practice...

[@HelloWorldbyprince]

Consistency brother Thanks bhai Bass share kardo channel ko aap mere motivation ke liye 🥰

[@divyanshsingh490]

I already share with my all friends..

[@divyanshsingh490]

Bhaiya Recursion pr v video bna do...ki approch ko implement kase kre properly

[@therahul5304]

Hats off

[@HelloWorldbyprince]

Keep learning buddy and please share this with your friends and colleagues

[@parwaagrawal]

Bhaiya Aapka code sirf first element ka count check karta hai aur return ho jata hai , Ye dekhiye isme aapka code kam nahi kar raha Array [3,1,1,1,2] ; isme apka code -1 return karega jabki sahi answer toh 1 hai...

[@ajaysiddartha4108]

AMAZING BRO!!

[@HelloWorldbyprince]

Thanks for your moral support ❤️

[@AjayPrajapati-bj4tr]

bhau time complexity ki link ka playlist btana

[@HelloWorldbyprince]

Yaar sorry Ajay Iska playlist to nahi hai mere pass abhi tak

[@UpscWithPavanOfficial]

👌👌👌👌👌👌

[@HelloWorldbyprince]

❤️

[@shubhamfuloria7047]

Thank you so much sir :)

[@HelloWorldbyprince]

keep learning buddy and be consistent and share my channel with your college groups that helps me a lot

[@tbmsahil8850]

bhaiya i solve the above problem but i used space

[@HelloWorldbyprince]

koi baat nhi see the solution and try again

[@tbmsahil8850]

@@HelloWorldbyprince vo tho dekh Li best explanation ever bro hats off

[@mukulbansal8269]

👍

[@HelloWorldbyprince]

😃😃

[@harshverdhanswami5850]

your naive solution is wrong bcz if I take value {3,1,2,2,1,2,3,3} then the o/p is 3 2 2 2 3 3 but we want 2 3 .please explain the naive solution.

[@lakshyasingh3061]

2 1 13 showing test case fail for this input . i code the program just like you

[@HelloWorldbyprince]

What output u r expecting and aa kya raha hai ... And compiler me v code karke iska expected output dekho aap

[@shashikantverma60]

O(n*logn) by sorting

[@Dheeraj-be9gt]

this algo is not capiable to sove this [8,6,4,6,2] testcase

[@redhat7581]

[1,2,1,3,1,4,1,6,8,9] kya ya question is method sa solve ho sakta hai

[@Csaim]

-1 ans hoga

[@SheherYarKhan-b6w]

Bhai dere bolo koi son na Le trivk

[@okey1317]

hindi malum nahimm

[@codinghero2001]

Best explanation of Voting Algorithm available on You Tube ❤🙏