Majority Element | Brute- Better-Best Approach | Moore's Voting Algorithm | & Pair Sum

[@PriyanshuVerma-hh9bq]

keep uploading lectures, i m following this series very consistently

[@bigbrain7933]

bhai question thaa tune pairsum or majority element khud se soch liya tha

[@sheevanulhaq3912]

​@@bigbrain7933 brute force approach to khud se soch liya tha but optimization abhi nhi ho rha Aa jayega with time ✌️

[@PrithaMajumder]

Watched "Majority Element | Brute- Better-Best Approach | Moore's Voting Algorithm | & Pair Sum" on 16/11/2024. ✅ Completely understood the concepts explained. 📝 Made thorough notes while watching. Thank You So Much for This Amazing Lecture 😊

[@StudywithmeAkku]

DSA series Day-11 completed I hope I will maintain this consistency with shraddha maam .Thankyou so much mam for this series and also thanks to Aman sir who behinde all of that❤🎉

[@jeffrinsamuel5358]

Are you in 1st year?

[@StudywithmeAkku]

@@jeffrinsamuel5358 yes

[@jeffrinsamuel5358]

@@StudywithmeAkku Nicee..Same here

[@bigbrain7933]

bhai question thaa tune pair sum or majority element khud se soch liya tha

[@Shubham_Karne]

Thanks a lot shraddha didi I am learning a lot from you considering web development or DSA you are the one who clears every concept in DSA I am being confident in DSA just bcuz of you didi I can't thank you enough for these precious stuffs❤😊

[@vishnuvardhan2687]

Successfully completed ✅ Day 11 lecture, thank you shradha maam for your valuable lectures to us 😊😊

[@surajdevv]

Keep going

[@shah4304]

Shardha Ma'am Brute force code ko bhi write kr deti hai , jo bhut achi cheej hai . Great

[@komalkaushal2695]

Completed and enjoying everyday with your lectures🎉

[@bigbrain7933]

bhai pari sum or majority element ka logic mam ke padane se pahle he aagya tha kya

[@bigbrain7933]

plese reply

[@devilsushgaming8151]

@@bigbrain7933 yess broo

[@mohammadparves8709]

The most thing I like about this series is that solving problems of leetcode

[@namangupta7271]

thank you very much mam you are the best teacher who teach dsa on youtube

[@bhavneet8416]

Next Level and thinking appriciate mam >>> Respect

[@azharalibhutto1209]

Thank you so so much for teaching DSA ❤❤❤❤❤❤

[@haiderali0801]

Thankyou shradha dii!

[@CodeSurgery-j8j]

Congratulations on your well-deserved 6M subscribers.🙂🙂🙃

[@Intelli_Jayant]

Please keep uploading, We will keep learning

[@Ironman-z2t]

Lecture 11 is completed. Thanks ❤mam.

[@bigbrain7933]

bhai pari sum or majority element ka logic mam ke padane se pahle he aagya tha kya

[@AamilAli2003]

23:51 array sort karne ke baad mid pe chale jao aur first aur last se compare karlo agar same hai to return kardo nhi to mid return karado if elseif aur else laga ke ho jayga

[@ninadkulkarni3530]

bhai agar sort kardiya to floor n/2 +1th element hi ans hoga na?

[@adityasingh3365]

Completed Lecture 11; Thankyou Mam;

[@CreativeDevLab]

it blew my mind 🤯🤯

[@AniketKumar-tu5cd]

class Solution { public: int majorityElement(vector& nums) { sort(nums.begin(),nums.end()); return nums[nums.size()/2]; } };

[@bigbrain7933]

hey bro i want to talk with you

[@Abhi_Singh-_-4]

Lecture done. 22-09-24. Thank you maam the different questions really help building logic.

[@killerronak0075]

thankyou so much for this great free resource❤❤❤❤

[@anushrisamrut-6263]

Successfully completed day 11✅

[@shubhampandey1754]

DSA series Day 11 completed successfully

[@syedshuaib8746]

The condition is that the number will be present >n/2. if we sort by default the middle element will be majority element then this much will be enough int n=nums.size( ); sort(nums . begin ( ) , nums . end ( ) ); return nums[n/2] ;

[@Kardam-Codes]

But the sort() function itself makes the time complexity nlog(n)

[@animeshdubey941]

​@@Kardam-Codesyep

[@RithushaKeerthi]

this works for the odd number of elements in the array not for even count ,right?

[@SanyamJain-m4c]

bro i tapplied it same going to comment but then see yours

[@diwanshukumar9866]

@@RithushaKeerthi yes, it's for odd number of elems bcoz it's easy level question

[@alwaysanujsharma]

38:58 Day 11 completed 👌💯

[@PrinceUmmer]

Love from Jammu and Kashmir ❤❤❤❤❤❤❤❤❤

[@50_arshidahmad91]

❤

[@proCoderShivam]

Lec 11 Completed ☑

[@Rajakumar29sep]

Thankyou✨Done✨Completed✨

[@aniketvishwakarma739]

Lecture 11 complete👌💯

[@prashanthreddy9935]

Lecture 11 Completed On 17-09-24 at 9:07PM thankYou Mam❤🎉

[@bloodyfiregaming9790]

Lecture done successfully 😁

[@animeshdubey941]

Excellent teaching 👏

[@YoursEditzz]

Don’t stop posting for this series

[@RASHIVishwakarma-p5g]

lecture no 11 completed thankyou mam

[@earthlinkdesignersedtech3531]

Day-11 Completed 👍💪

[@bhavenprajapat851]

Waiting for that 😊notifications ❤

[@IRONMAN-kq6dx]

Day 11 complete 21 September 2024 ❤ thankyou Sharadha Mam 😊...

[@CodewithAnuragBassu]

awasome series❤❤

[@shreyaG438]

can we known until when u will complete this playlist

[@Shaswat_Shrivas]

Day 11 Completed!

[@AiTrailerVault]

Day 9 of asking related notes 😮

[@MoNiL_DeVLuK1111]

L-11 DONE 🚀

[@sakethsai5557]

Q)Find the pairsum from array = [3,4,7,8] with target =11? ans: pairsum = (7,4) reason (shraddha=7 & aman= 4)😁

[@jeffrinsamuel5358]

Nice observation 😃👍🏻

[@animeshdubey941]

🎉😂

[@ammarshaikh4054]

itna dimag agar padhai me lagaya hota toh aaj ias hota

[@jeffrinsamuel5358]

@@ammarshaikh4054 Arey woh padhai hi toh kar rha hai

[@yuvrajnegi1023]

In majority element problem.After sorting we return n/2 element of array because a majority element occurs more than n/2 time. But it's not optimize it take O(nlogn) time complexity❤

[@anandmaurya6384]

for sorted array we can use : return arr[n/2];

[@KalariyaDhruvi]

Thank you so much mam u are great 🎉 I also learn c language from u 😊

[@AjayKumar-uf6zq]

Hi

[@chill_guy9240]

23\09\2024 i am this much consistent about something for the first time in my life I have watched 7 videos in 8 day(one day i was sick)

[@Ayush-rx9pk]

3 semester watched this session on 9 october finished eleventh lecture

[@lamborzgamer2638]

Thank you so much mam🔥🔥🔥🔥

[@sheScripts]

Q. PAIR SUM - What if multiple pairs are available?? Let's say we have an array [2, 5, 7, 8, 10, 11, 15] and target is 13, pair could be 2,11 and 5,8 Solution (in JavaScript): let arr = [2, 5, 7, 8, 10,11,15] let target = 13; let i = 0; let j = arr.length - 1; while (i < j) { let pairSum = arr[i] + arr[j]; if (pairSum < target) { i++; } else if (pairSum > target) { j--; } else { console.log(arr[i], arr[j]); i++; j--; } }

[@anmolprashar6593]

Thank you so much

[@sam-s2t4r]

Completed 😊

[@ssquadisid1858]

Completed on 22:09;24:: 21:43

[@Shubham20148]

Thanks for video 😊

[@mansishirode9907]

Completed ❤the lec

[@bigbrain7933]

bhai pari sum or majority element ka logic mam ke padane se pahle he aagya tha kya

[@mazedul1448]

Thank you ma'am

[@rcreations9617]

Day 11 completed

[@PriyaPandey-ge4wv]

successfully completed~!!

[@SagarMaheshwariS]

Day 11 completed ✅

[@jhonmax4540]

Lecture-10✅(done)

[@zee.techie]

Big fan from Pakistan ❤❤

[@SharoonGill-q7v]

Thank u for this ❤

[@itz_akash_Gupta]

DAY -11 COMPLETED

[@mohdyasir5421]

Thanks a lot 👍

[@Damdim527]

class Solution { public: int majorityElement(vector& nums) { unordered_mapmp; int h=nums.size(); for(int i=0;ih/2){ return i.first; } } return -1; } };

[@ayushjha1595]

Lec 11 completed

[@PriyanshuMishra-ze6ol]

Thank you mam ❤

[@ShreyaPriyadarshini]

Day 9 of DSA journey , completed this lecture on 21.10.2024 at 12:07 am

[@likitha2005]

Day-11 Done ✅

[@moinansari3729]

Sep 16, 2024, Lec 11 Completed

[@muhammadarhamshahbaz4805]

Completed 💯

[@Ankit2u-IIT]

Completed on 14/10/24. I hope there will be practice problems in the future videos.

[@PRASHANTSHRINGI]

All lectures completed

[@prashantyevate]

Completed lecture

[@Saddam-gg7gj]

Plzz upload videos daily

[@KunalVats-v3f]

The best series

[@bigbrain7933]

bhai question thaa tune pairsum or majority element khud se soch liya tha

[@anishalam9648]

done dona done london mam bhot bahot shukriya apka mam

[@diyadodiya6026]

thank you didi

[@DIBYENDU_MALLICK]

Lecture 11 complete ✅ 27/09/24

[@Y2k_Y2K38_Technology]

Hello 😁 vector is very fast library 👍👍👍

[@girdharisinghyadav]

thank you Shradha Didi 🥰🥰\\ I complete Lecture 11 Date /17/09/2024

[@cargammer01]

love you from nepal

[@abhishekkumarraj6199]

Lecture 11 completed

[@Govind_thakur99]

Attendance for Day 10

[@Theclassicalplayground]

I am first view of this lecture 😄😄😄

[@HistoryofIslamicSultans0786]

Day 11 completed

[@YashSharma-xk7pz]

Present ma'am 🙋🏻‍♂️

[@karthikthangadipelli]

Thank you, mam

[@gautamksharma]

Day 11 complete Plz provide note of lecture 😊😊😊

[@ShivamJain001]

Lecture 11 completed successfully on 17/09/2024🙂

[@MANISHSINGH-qj5iu]

lecture completed

[@PRASHANTSHRINGI]

All leacture are completed

[@souravbhattacharya7927]

Day -11......................... complete....

[@NamanSachdeva-s8x]

Lecture 11 completed

[@-Puligantimahendar]

please keep uploading

[@NikhilYadav-q3h]

done ma'am !

[@txusiff]

Completed on 7th November, 2024

[@mayankbhadoriya4432]

Keep uploading

[@i_Have2BrainCells]

PUT IT IN THE PLAYLIST, EDITOR WAKE UP

[@cooldude239]

Attendance ✅✅