Guys, Are you liking the DSA For Placement series ? Codechef is the place to hone your coding & programming skills. Click here bit.ly/2Wbt6Dw to register yourself on Codechef for the coding practice problem & CodeChef Monthly Programming Contests - Long Challenges, Cook-Offs, Lunchtimes & Starters.
8:00->Heap Height->logn Delete-> O(logn) Insert->O(logn) left child->x*2 , right child->x*2+! (when indexed from 1 ) parent node->x/2 33:35->Implementation 1:01:00->code to insert & delete an element from heap Priority queue->max heap in C++ 1:34:50>priority queue's functions (push(),pop(),swap()) 1:37:10->using priority queue as min heap 1:38:50->Question 1 1:52:40->Question 2
sir you pronounced the wrong question. I have watched several times and concluded that. An array having elements that represent piles of stone. You have to minimize it. so at the end you receive the minimum no of sum of piles. But did not mentioned it in any timeframe. if i pick one element and divide it by 2 then what is the end goal.? like i have to half it so you can get maximum no piles or minimize it so you get minimum no of piles.
Guys, Are you liking the DSA For Placement series ?
Codechef is the place to hone your coding & programming skills.
Click here bit.ly/2Wbt6Dw to register yourself on Codechef for the coding practice problem & CodeChef Monthly Programming Contests - Long Challenges, Cook-Offs, Lunchtimes & Starters.
Can anyone share homework problems for this video?
8:00->Heap
Height->logn
Delete-> O(logn)
Insert->O(logn)
left child->x*2 , right child->x*2+! (when indexed from 1 )
parent node->x/2
33:35->Implementation
1:01:00->code to insert & delete an element from heap
Priority queue->max heap in C++
1:34:50>priority queue's functions (push(),pop(),swap())
1:37:10->using priority queue as min heap
1:38:50->Question 1
1:52:40->Question 2
That stones ques was in my interview exam. I did not know it then but now i know. Thx fraz bhaiya
Can u tell the timestamp of this ques
Plz alow subtitles option for the video
sir at that question 3 4 5 1 6 7. at the end we will get 0. after colliding each stone ?
1:49:00 par one kese aaya
Session start at 6:04
sir you pronounced the wrong question. I have watched several times and concluded that. An array having elements that represent piles of stone. You have to minimize it. so at the end you receive the minimum no of sum of piles. But did not mentioned it in any timeframe. if i pick one element and divide it by 2 then what is the end goal.? like i have to half it so you can get maximum no piles or minimize it so you get minimum no of piles.
I asked it to gpt and it concluded that i have to minimize it. So your approach fit perfectly in this case.
Sir complete the series
It is every Tuesday Wednesday and Thursday.
is heaps and priority queue are same
Priority queue is max heap basically.
can someone give me HomeWork Question
no
Can anyone give me discord link