Kth smallest element in an array | Kth Largest element in an array | Heap | Priority Queue

[@CoderArmy9]

3 Approaches se Problem Solve kiya hai, Bataiye fr, Maja Aaaya...

[@pranavmittal9619]

Yes why not

[@shrishtdev9961]

last wala method shi tha bhaiya❤❤❤❤❤

[@shrishtdev9961]

last wala method shi tha bhaiya❤❤❤❤❤

[@shrishtdev9961]

last wala method shi tha bhaiya❤❤❤❤❤

[@be_a_DT]

Thank you sir ! Really Helpful

[@SajanKumar-ef1ur]

the mentor , the instructor , specility - chamka dena concept ko , selfless, Thank you

[@GamingArenaaa]

Easiest DSA topic till now💯💯🤟🤟🔥🔥

[@kapilkhandelwal48]

mza aa agya bhaiya itne dino baad lecture dekh k

[@Pallab01]

3:Kth largest element in a stream: vector kthLargest(int k, int arr[], int n) { // code here //using min_heap priority_queuep; vectorans; for(int i=0;i

[@smitallunawat6167]

Too good explanation... feel hi aa gaya bhaiya!!

[@ManojSinghRawat-x2w]

bhaiya hum appke sath hamesha bane rahenga ❤ aaj bhi last tak😎

[@vijaysingh-n6p9j]

Bahut hi bdiya tha lecture

[@divyanshrawat2859]

hats off to your teaching sir.

[@chanchalsoni7535]

best content all over the you tube

[@rahulsingh3418]

Best explanation

[@ankitnegi5628]

Nice Bhaiya

[@Sanataniblood-mb5pu]

Another wonderful lecture

[@utkarshsingh09]

Hats off to you Sir 🙌🙌

[@LisaPrasad66]

nice explanation sir

[@CalmingVideos-qm3rn]

Very knowledgeable video

[@allinonemoviesyt]

50:33 Homework - kth largest element in a stream vector kthLargest(int k, int arr[], int n) { // code here vector ans; priority_queue pq; for(int i=0; i

[@punitsharma584]

best approaches❤❤❤❤❤❤✌✌

[@universalmeditationmusic9299]

nice series ❤

[@aman_kumar9146]

thanks bhayiya for such great content

[@Abc-rz4ps]

Best teacher !!! 🙏🙏🙏

[@mehwishzehra1356]

chamak gaya bhai.❤️

[@SmritiSharma-vv7ib]

Amazing Negi bhaiiii

[@manish_kumar_iitg]

3: Kth largest element in a stream:- vectorans(n); priority_queue p; for(int i = 0; i

[@hiteshsharma5034]

Gud mrng bhaiya

[@12krishna_creator]

Chamak gya bhaiya 🎉🎉🎉🎉🎉

[@ankitchoudhary2914]

don't know why but ajj ka class kuch jyada interesting thi😎😎😎😎😎

[@tradun.s9760]

best dsa playlist

[@RohitSharma-wu8te]

Rohit bhai tussi great ho

[@sdtedit5165]

bhaiya aap ni hote to pata ni hamara kya hota itna accha content log apne paid cources me bhi nahi dete

[@VineetDixit]

thanks for the lecture

[@AbhishekKumar-vd1po]

great video

[@codeadityavyshnav3018]

great sir

[@sirfrozenpenguin5486]

Nice Video Sir

[@12krishna_creator]

Chammak gya hai 🎉🎉🎉🎉🎉 thank you

[@JaiShreeRam_A1]

mzaa aaa gyaaaa BHAIYA

[@mahimsunny-p1g]

vector kthLargest(int k, int arr[], int n) { priority_queuep; vectorans; for(int i=0;i

[@tradeiteasyy]

Loved it

[@asad_iliyas]

Interesting

[@heetpatel3037]

Jai shree Ram ❤️ kya hi ajab padhato ho bhaiya bohot sahi please demotivate mat hona Arjuna ki tarah bas laksh par focus kijiye

[@sonakshipatel-Tp]

Nice bhaiya 🎉

[@KaranSuthar_28]

Maza aa gaya thank you bhaiya

[@saumyachauhan174]

superb bhaiya♥♥

[@allinonemoviesyt]

59:23 Homework : Time Complexity :- 1. sabse pehle hum K1 elements ko priority queue me daalege to uska time time compleity hoga = O(K1logK1) 2. fir (N-K1) elements ko top elements se compare krege aur insert krege heap me , to uska time complexity hoga = O((N-K1)logK1) 3. fir hum (K2-1) elements ka new priority queue bnayege uska time complexity hoga = O((K2-1)log(K2-1)) 4. fir hum (N-K2+1) elements ko top elements se compare krege aur insert krege heap me , to uska time complexity hoga= O((N-K2+1)log((K2-1))) 5. fir hum K1 elements waale heap ke elements ka sum nikalege uska time complexity hoga = O(K1logK1) 6. fir hum K2-1 elements waale heap ke elements ka sum nikalege uska time complexity hoga = O((K2-1)log(K2-1)) overall time complexity in sb ka addition hoga Space Complexity :- 1. K1 elements ka priority queue bnayege to space use hoga = O(K1) 2. K2-1 elements ka priority queue bnayege to space use hoga = O(K2-1) overall space complexity hoga = O(K1 + K2 -1)

[@karankumar3983]

Thanks buddy I

[@saumyachauhan174]

time complexiety mei insertion and deletion dono hoga na to 2logk1 and 2 log(k2-1) karenge na?

[@bharatmalik2756]

chamak gya bhaiya 😎

[@game-pc7ei]

Chamak gya bhaiya 😃

[@rejaulislam2593]

alhamdulillah chamak gaya

[@Aniruddha_Mukherjee]

Problem 2 : ________________________________________ class Solution { public: int findKthLargest(vector& nums, int k) { priority_queue pq; for(int i = 0; i

[@amorphous8826]

Thank you sir

[@pranavmittal9619]

sahi bol rahe maine toh 3 lakh mahine ka socha h package 25 students h mere college se 40+ lpa ke package wale 2024 me

[@manasagarwal9341]

maza aagya bhaiya❣

[@ParvezKhan-mj7yt]

Thanks bro🙏🙏

[@seekingsoul871]

Bhaiya chamak gaya.

[@ShivshankarKumaryadav-m4f]

1:08:02 tak bhaiya persent. atendance please😊😊

[@itshirdeshk]

Time and space complexity of last question: Time Complexity -> O(nlogk2) Space Complexity -> O(k1 + k2) -> O(k2), if you are using priority queue || O(1), if you are using step-down approach.

[@sayanghosh2018]

❤

[@be_a_DT]

Thank You Sir !

[@abhinayjangde]

1:06:25 Sum of elements between k1'th and k2'th smallest elements | Bhaiya Maine Aise banaya hai long long sumBetweenTwoKth( long long A[], long long N, long long K1, long long K2) { // Creating Min Heap priority_queue pq; for(int i=0; i

[@Aniruddha_Mukherjee]

Good morning Bhaiayaji 🥰🥰

[@CoderArmy9]

Good Morning Boss

[@AnkushKumar-kv7zm]

chamak gya bhaiya

[@saumyachauhan174]

by approach of quick select: class Solution { public: int findKthLargest(vector& nums, int k) { int left = 0, right = nums.size() - 1, kth; while (true) { int idx = partition(nums, left, right); if (idx == k - 1) { kth = nums[idx]; break; } if (idx < k - 1) { left = idx + 1; } else { right = idx - 1; } } return kth; } private: int partition(vector& nums, int left, int right) { int pivot = nums[left], l = left + 1, r = right; while (l pivot) { swap(nums[l++], nums[r--]); } if (nums[l] >= pivot) { l++; } if (nums[r]

[@techmjo2007]

Bhaiya Hashing Playlist wali Video kb Aayengi ???

[@mohit6215]

Waiting for baap playlist of Hashmaps

[@vinodbarti9237]

thnks bhaiya 😄

[@sayyedtaimoorshah6345]

damaka daar

[@sabhyaa]

best!

[@Ajkr2]

bhaiya you r god

[@VinuSawant-z1k]

Bhaiya App Dsa Series Puri Complete Karva Doge Na😅❤️

[@ahmadjawwad3983]

love u bhai apka

[@surajadhikari.]

Present till end bhaiya

[@nakulparmar126]

✨✅📈

[@AMANKUMAR-rz3fu]

Ok bhaiya

[@akshaythakur4231]

Last tak❤

[@ChandanKumar-rv5xw]

🔥🔥

[@gajendrasinghdhaked]

🤩

[@PradeepKumar-bc1ez]

Mja aaya

[@Harshmishra0007]

Ram Ram bahi❤

[@arunfrancis5921]

I don't want to normalise the 3lpa package in this industry 😻😻

[@akashkewat1219]

Done bhaiya.

[@ParvezKhan-mj7yt]

Bro thanks

[@Noobiee_FPS]

last tak dekha bhaiya

[@Sanataniblood-mb5pu]

❤❤❤❤❤

[@ks.letsstartstudy.3994]

last tak😊

[@machinecode2.047]

Good morning sir

[@YashSaini007]

Bhaiya Radhe Radhe 🙏

[@CoderArmy9]

Radhe Radhe bhai

[@dealseasy363]

Till the End

[@datarobo1718]

class Solution { public: vector kthLargest(int k, int arr[], int n) { // code here vectorans(k-1,-1); priority_queuep; for(int i=0;ik){ if(p.top()

[@Unifyall]

last tak😀

[@secretbhiya6176]

Bhiya Course main new aaya hoon mujhe pata nhi chal rha main coder's army start kahan se kroon koi syllabus ya topic based hai kya jhan se main iss sare lecture ko start krron

[@SajjalFatima-yt6oq]

Roadmap Time and space complexity for Data structure and algorithm. Arrays linkedList stack queues Hash tables or HashMaps Recursion (tail non tail) Tower of hanoi problem binary trees binary search trees Heaps Sorting algos including Merge Sort, Quick Sort, Heapsort graphs DFS BFS MST Djisktra shortest path algo Floyd warshall algo Now some advance and optional topics AVL trees B trees 2 3 trees Fibonacci heaps N heaps or n children heaps. Kruskals Union find for MST Strongly Connected components algo Directed Acyclic Graphs.

[@SajjalFatima-yt6oq]

Follow this roadmap and watch the playlists of these topics one by one

[@ritwiksaha2009]

//Kth largest element in a stream vector kthLargest(int k, int arr[], int n) { vectorans(n); //this will store the answer //initialize ans with -1 for(int i=0; i

[@nepalihoni9213]

opop

[@RanjeetKumarceb]

Last tak chamak gaya

[@yashnatholia2332]

🙏🙏🙏

[@anuragrajput4613]

Bhaiya guide kardo or kya karna he agae

[@Ajay-ie4mr]

last Tak

[@shubhamkumarjha9192]

Good morning bhaiya ji

[@CoderArmy9]

Good Morning Boss

[@shrishtdev9961]

bhaiya mai hmesa nya hi sikhta huu

[@vaishalichoudhary5]

Kth smallest Element using QUICK SELECT:) AVERAGE CASE T.C=O(KN) WORST CASE T.C=O(N^2) class Solution{ public: // arr : given array // l : starting index of the array i.e 0 // r : ending index of the array i.e size-1 // k : find kth smallest element and return using this function int calpivot(int arr[],int s,int e,int k){ int pos=s; for(int i=s;i

[@animani5421]

Good morning bhaiya

[@CoderArmy9]

Good Morning Boss

[@itshirdeshk]

Day 188 ✅🔥