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

This is the video under the series of DATA STRUCTURE & ALGORITHM. We are going to solve Questions from GeeksforGeeks Majority Element in O(N) Time Complexity and O(1) Space complexity. Given an array A of N elements. Find the majority element in the array. A majority element in an array A of size N is an element that appears more than N/2 times in the array.
Which is a very famous and Routine question asked in Interview. The question is from the Topics Data structure. A full easy concept in Hindi. This is Question is asked in Many companies like Google, Amazon, Oyo Rooms, Paytm, Samsung, Adobe, etc..
We also Provide courses on Competitive Programming and Data structure. Please see our Full Playlist on our Channel.
----------------------------------------------------------------------------------------
► Homework Question: - - - - - - - - - - - - - - - - - - - -
----------------------------------------------------------------------------------------
► Majority Element: practice.geeksforgeeks.org/pr...
► PDF of Majority Element: github.com/Prince-1501/Hello_...
► CODE of Majority Element: github.com/Prince-1501/Hello_...
----------------------------------------------------------------------------------------
*Follow me *
LinkedIn► / iamprince
Facebook► / helloworldofficials
Instagram► / helloworldbyprince
Twitter► / prince_king_
----------------------------------------------------------------------------------------
►Our Playlists on:-
►Competitive Programming : • How to start Competiti...
►C++ Full Course : • L-01 || Introduction a...
►Algorithms : • L-01 || Prefix Sum Arr...
►Data Structure: • Data Structures with C...
------------------------------------------------------------------------
Our Students Contacts Form:-
Form link: docs.google.com/forms/d/e/1FA...
------------------------------------------------------------------------
#interview_preparation #geeksforgeeks #Hindi

[@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

[@ChessKaChaskaa]

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

[@HelloWorldbyprince]

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

[@pulkitmethaniya6471]

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

[@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

[@codinghero2001]

Best explanation of Voting Algorithm available on You Tube ❤🙏

[@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

[@mokshdadave5077]

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

[@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.

[@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 ❤️

[@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

[@deepanshugarg8411]

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

[@HelloWorldbyprince]

You are most welcome

[@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;

[@user-sk5pi8sp3r]

Voting algorithm best video on youtube

[@ayushijindal4898]

Beautifully Explained 👏 Keep Explaining😇

[@ankushladani496]

Thank You Bhaiya for this....

[@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 😀

[@aishwaryasanjayjadhav2619]

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

[@HelloWorldbyprince]

You're welcome 😊

[@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

[@Suraj.18]

thank you bhaiya🥰

[@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

[@subhranilbagchi580]

your explantions are awsome man

[@HelloWorldbyprince]

Thanks a lot 😀

[@vakilsingh5086]

isa element frequency check k lia use kr skta hai

[@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 😀

[@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

[@BMEFaisal_khan]

great ,Explanation sir

[@HelloWorldbyprince]

Thanks 😊😊

[@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

[@sakshisingh3851]

Best explanation ever!!!!!

[@HelloWorldbyprince]

glad u liked it

[@OpenDiscussion__55]

Thanks❤, Bhaiwa

[@Crazy-is3yx]

Its really helpful...😃thanks..sir

[@HelloWorldbyprince]

Most welcome

[@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 😀

[@deepakgaroda975]

thank you so much sir for such nice explaination

[@HelloWorldbyprince]

Keep sharing with your friends and colleagues

[@suhelali4547]

tons of thanks

[@HelloWorldbyprince]

🤩🤩

[@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...

[@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 😀

[@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;

[@seemaalam3127]

lovely explained😍

[@HelloWorldbyprince]

Thanks a lot Seema

[@JGyanRaj]

I was waiting for this question

[@HelloWorldbyprince]

Now, your wait is over 😅😅

[@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.

[@rahulsati5819]

nice explanation bhaiya

[@HelloWorldbyprince]

Keep learning buddy 😊

[@suhelali4547]

amazing work sir

[@HelloWorldbyprince]

Thanks 🙏

[@ajaysiddartha4108]

AMAZING BRO!!

[@HelloWorldbyprince]

Thanks for your moral support ❤️

[@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

[@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.

[@therahul5304]

Hats off

[@HelloWorldbyprince]

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

[@ABHISHEKKUMAR-wc9ke]

bhaiya hashing bhi toh use kr sakte hi isme

[@HelloWorldbyprince]

Yeah u can

[@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

[@mukulbansal8269]

👍

[@HelloWorldbyprince]

😃😃

[@ankitsharma7541]

thanks bhai you help us a lot.

[@HelloWorldbyprince]

Thank you for your support

[@Dheeraj-be9gt]

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

[@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 😂😂😂🙏🙏

[@shashikantverma60]

O(n*logn) by sorting

[@arpitshrivastava672]

Sir, brute force algorithm kya hoti h ?

[@AnkitSingh-wq2rk]

sabse basic bina dimag lagaye solution dimag mein aaye

[@arpitshrivastava672]

@@AnkitSingh-wq2rk thanks

[@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

[@PPP-7061]

👌👌👌👌👌👌

[@HelloWorldbyprince]

❤️

[@AjayPrajapati-bj4tr]

bhau time complexity ki link ka playlist btana

[@HelloWorldbyprince]

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

[@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

[@sandeepkumarkasera1]

[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

[@sandeepkumarkasera1]

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

[@HelloWorldbyprince]

It happens with me also 😀😀

[@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

[@okey1317]

hindi malum nahimm

[@beinghappy9223]

Best explanation of Voting Algorithm available on You Tube ❤🙏

[@HelloWorldbyprince]

Wow, thank you!