Heap 6 Interview Problem | Height of Heap | Minimum Cost of ropes | Magician and Chocolates

[@mohit6215]

This man from IIT GUWAHATI IS SHAPING OUR FUTURE ❤❤

[@MrAnon07]

Really helpful videos♥ 1:21:48 Last tak

[@utkarshsingh09]

For students coming to see review of his videos "I gotta tell you, It was perfect. Perfect. Everything, down to the last minute details.

[@ShivshankarKumaryadav-m4f]

1:21:56 last take Thanks bhaiya and thanku coder army

[@allinonemoviesyt]

00:02 Understanding and solving heap related problems 02:23 Understanding the concept of heap height in detail 06:55 Understanding the height formula of the heap 09:07 Logic behind multiple divisions and height calculation 13:25 Finding minimum cost of connecting ropes 15:31 Finding the minimum cost of connecting ropes 22:03 Explaining the process of shifting elements in solving a problem 25:48 Shifting elements to maintain order in a heap 28:01 Understanding and using Min Heap in priority 31:58 Priority order for inserting and removing elements in a heap 33:49 Efficiently perform log operations and cost calculations 37:35 Optimizing insertion process using priority queue 39:16 Creating and using heaps to solve problems 43:21 Magician demonstrating a chocolate eating trick with a twist 45:20 Solving chocolate distribution problem with strategic approach 49:10 Implementing a heap and sorting the elements 51:02 Understanding time complexity of heap operations 54:48 Understanding the time complexity of heap operations 56:26 Implementing priority queue utilizing heap for maintaining a min heap structure. 1:00:11 Selecting the heaviest stones based on weight. 1:02:02 Collision of stones in a heap 1:05:48 Explanation of the process of removing elements from a heap 1:07:23 Returning the top element of a priority queue after certain operations. 1:11:26 Maximize profit by selecting and selling seats strategically 1:13:21 Select the maximum value and perform delete and insert operations simultaneously. 1:16:56 Understanding and implementing heap data structure 1:18:50 Implementation of a heap algorithm

[@CoderArmy9]

Thanks

[@study-yd6es]

Amazing Lectures!! This playlist is going to boom so much in the future

[@anshror2583]

Bro has some serious teaching skills wow well done rohit bhaiya

[@bharatmalik2756]

Bhaiya OP content and mind blowing explanation 😼

[@rajnishrajain5003]

NO ONE CAN GIVE THIS LEVEL OF EXAPLATION🔥🔥

[@asad_iliyas]

Bhaiya you have increased our level so much that now these easy questions doesn't excites me. Please do some hard level questions.

[@pranavmittal9619]

Learning : every second important just go with the flow and embrace in mind and make notes and do revision

[@Aniruddha_Mukherjee]

Last Stone Weight : _________________________________________________ int lastStoneWeight(vector& stones) { priority_queue q; for (int i = 0; i < stones.size(); ++i) { q.push(stones[i]); } int first = 0; int second = 0; while (q.size() > 1) { first = q.top(); q.pop(); second = q.top(); q.pop(); int dif = abs(first - second); if (dif > 0) { q.push(dif); } } return (q.size() > 0 ? q.top() : 0); }

[@be_a_DT]

Really helpful videos 1:21:48 Last tak

[@sonumondal7798]

maja aa gaya bhaiya sare problem khud se solve ho gye heap padhne ke baad❤❤

[@nikhilrai6373]

your DSA course is more comprehensive than others ❤❤

[@sumangoswami576]

last tak dekh liya bhaiya bhot badiya lecture the 🙂🙂🙂

[@heetpatel3037]

Jai shree Ram ❤️ ek dum OP content bhaiya what an explanation. :::))

[@rajurock9479]

Nice ❤❤ best series on heap concept chamka gaya

[@SeetaramSharma-ku7oy]

Seriously teaching no backwas Rohit bhaiya ki jay ho

[@aakashy_07]

Thankyou bhaiya.. Priority queue✅🤙🏻

[@divyanshsharma673]

Great Lecture as always !! 🔥🗿

[@sachinprajapati815]

last stone weight came in my drive question but i did not know priority queue so I could not solve it. thank you bhaiya ❤❤.

[@CoderArmy9]

Ab lag rha hga, ye toh bacho wala question th..

[@Aniruddha_Mukherjee]

Problem 6 : ___________________________________________________ int Solution::solve(vector &A, int B) { priority_queue q; for(int i = 0; i

[@ranjeetguptaiitm2852]

very nice explanation🥰🥰

[@Sanataniblood-mb5pu]

Thanks bhaiya ❤️🙏🏻 Another wonderful lecture bhaiya ❤❤

[@dhruv12151]

Superb lecture bhaiya 👍👍👍👍👍

[@Child-game-1]

wonderful sir

[@zafrul_islam]

Bhaiya maja aa gya array and heap wala concept sikh kar ke ki kb array ka use karna hai and kb heap ka 🔥🔥🔥🔥

[@AbhinavShinde-gr4bt]

superb lecture

[@vinodbarti9237]

Thnks Bhaiya Able To Solve 2 Question By Self 😀😀

[@aakankshasharma-h7f]

Bhaiya you are really amazing .Thankyou so much

[@rejaulislam2593]

last tak...alhamdulillah...may allah bless u

[@Sanataniblood-mb5pu]

1:21:58 Last tak ❤❤

[@SUN_SUN2]

last tak Amazing lec

[@punitsharma584]

nyc completed this

[@shubhamkumarjha9192]

Good evening bhaiya ji. 💖

[@akshaythakur4231]

Wow ❤❤

[@Ramankumar-lo4hv]

chamak chuka hh bhaiya ji😁

[@utkarshsingh09]

1:21:53 Last Tak 🎉

[@Aniruddha_Mukherjee]

Problem 5 : ____________________________________________ /* function parameter names have been changed for simplicity */ long long pickGifts(vector& B, int A) { priority_queue q; long long sum = 0; for(int i = 0; i

[@virvalgyan4263]

❤

[@arnavgupta5830]

class Solution{ public: int heapHeight(int N, int arr[]){ // code here int height=-1; for(int i=0; i

[@dayashankarlakhotia4943]

static int heapHeight(int N,int[]arr){ return (int)(Math.log(N)/Math.log(2)); }

[@Vardanaggarwal]

amazing.

[@GauravKumar-jw3fu]

RAdhe- RAdhe BHaiya Ji❤

[@YashSaini007]

Bhaiya Radhe Radhe 🙏

[@ankitchoudhary2914]

LOved 2Days' class

[@Noobiee_FPS]

last tak dekh ke smjh aa gya bhaiya kab heap ko use krna h

[@amannegi1817]

Chamakgya bheji❤

[@chanchalsoni7535]

aap nahi hote to itne hajaro learners ka kya hota🥺🥺.....#lifeSaviour😇

[@AbhishekKumar-lp7wy]

Good night bhaiya ji

[@divyanshsharma673]

लास्ट तक 🎉

[@AnshuKumari-gz7ju]

thank u bhaiya

[@RJFF3-r7w]

last tak,pura chamak gaya...

[@manish_kumar_iitg]

Problem 5:- long long pickGifts(vector& gifts, int k) { priority_queuep; for(long long i = 0; i< gifts.size(); i++){ p.push(gifts[i]); } while(k--){ p.push(sqrt(p.top())); p.pop(); } long long ans = 0; while(!p.empty()){ ans += p.top(); p.pop(); } return ans; }

[@vijaysingh-n6p9j]

bhaiya mja aa gya

[@Sumit-wy4zp]

Rohit Bhai Please project ke upper ek video chahiye . pichle 1 saal se dsa kar raha hun but projects ka koi idea nahi hai. abhi 6th sem me hun.. bahut demotivate feel kar raha hun

[@zafrul_islam]

@CoderArmy9 haan bhaiya please

[@saketjaiswalSJ]

hacker or wott thanks bhai

[@sbworld13]

❤️✨🔥

[@YashSaini007]

Day - 184 #180DaysOfCode

[@heetsheth6402]

Last Tak ❤❤❤❤

[@heetpatel3037]

Last tak ❤️

[@kuldeepparmar9861]

last tk chamak gya

[@Xcoder__1957]

❤

[@allinonemoviesyt]

1:10:11 Homework Question class Solution { public: long long pickGifts(vector& gifts, int k) { priority_queue pq; for(int i:gifts) pq.push(i); while(!pq.empty() && k--){ pq.push(floor(sqrt(pq.top()))); pq.pop(); } long long ans = 0; while(!pq.empty()){ ans += pq.top(); pq.pop(); } return ans; } };

[@itshirdeshk]

Day 184 ✅🔥

[@mohit6215]

last tak kon kon tha

[@deepfan14]

Bro is this is good or not

[@deepfan14]

Should I do this or course of c++ by codehelp-by babbar

[@mohit6215]

It is awesome ❤

[@JHARAJESHRAMAN]

bhaiya JS ka badle full stack development jo bhi sahi rahe vo launch kardo aap🙏

[@Aniruddha_Mukherjee]

problem no : 1 ______________________________________ long long minCost(long long arr[], long long n) { // Your code here priority_queue pq; long long int ans = 0; for(int i = 0; i 1) { first = pq.top(); pq.pop(); second = pq.top(); pq.pop(); ans+=first+second; pq.push(first+second); } return ans; }

[@ManojSinghRawat-x2w]

last tak😎

[@Aniruddha_Mukherjee]

🥰🥰

[@pranavmittal9619]

Last Tak 🎉 vo bhi bina skip kare

[@tradun.s9760]

last tak 🤟🤟

[@AMITKUMAR-ds4hp]

Hi boss

[@ShubhamKumar-vk8me]

Chamak gaya bhaiya

[@akashparashar1851]

antim tak

[@OnlyPc-c9n]

last tak ❤

[@pankajdubey1123]

thinking process ++++++

[@Aniruddha_Mukherjee]

last tak 🤩

[@anuragpandey715]

last tak 🤗🤗🤗🤗🤗🤗

[@deepfan14]

I am think to try this course can plz some one tell me that does this course teach you all concept with in-depth knowledge

[@CoderArmy9]

Bro aap first lecture dekh lo, aapko answer mil jaayega..

[@deepfan14]

Thanks ❤

[@wisdomMate]

Chamka++

[@NitinSingh-zy8io]

QUESTION:1 MOST UNIQUE SOLUTION ALL OVER THE INTERNET class Solution{ public: int heapHeight(int N, int arr[]){ // code here int count=0; for(int i=1;i

[@maheshpatil1750]

last tak.....😁

[@VivekGupta-rw6oo]

Bhaiya last tak

[@darshanrathod-c1h]

[@Rahul-cn8bq]

heap++

[@kirankarakalli1408]

Lasttak

[@vaishalichoudhary5]

Last tk:)

[@defenceboimotivation]

lasttak

[@vivekpaliwal1876]

Aap q.top() and q.pop() Do steps me kyu krte ho? Simple ek line me ho skta h...q.pop() likho bss

[@avinash2421]

Last Tak

[@SmritiSharma-vv7ib]

Last tak bro

[@anuragrajput4613]

Last tak

[@nepalihoni9213]

op op

[@PradeepKumar-bc1ez]

Last tk

[@pankajdubey1123]

last tak

[@jagriti4813]

Brother ik TRIES topic in c pr bhi vdo needed h.@coderarmy

[@CoderArmy9]

Tries, segment tree , fenwick Tree last mein cover hga, don't worry...

[@harshitpatil6138]

Last tak❤

[@parthpath2672]

Last tak

[@balramsinghjadon822]

Last tk