Write Priority Queue using Heap- Solution | Hashmap and Heap | Data Structure and Algorithms in JAVA
Vložit
- čas přidán 1. 08. 2020
- Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.
NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we explain the solution to Write Priority Queue using Heap.
For a better experience and more exercises, VISIT: www.pepcoding.com/resources/o...
#pepcoding #java #programming
Have a look at our result: www.pepcoding.com/placements
Follow us on our FB page: / pepcoding
Follow us on Instagram: / pepcoding
Follow us on LinkedIn: / pepcoding-education
Join us on Telegram: t.me/joinchat/UVTjJE83a-zFnPB
This is gem sir. It took me a minute to process how beautifully you taught this concept easily .I have been through some other videos too but my search ends here.
Glad it helped! and If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
Your explanation was amazing! You broke it down perfectly.
Thanks for being such a great teacher!❤❤
Finally ,I found BHAGWAN!!
I was tying to understand this from long time but was not getting any clear explanation ,but randomly I found this GEM which cleared my all doubts from its lustre and shine... THANKYOU VERY MUCH FOR THIS AMAZING EXPLANATION.
Perfect GURU for DSA, Nobody can teach DSA like you Sir.
Your explanation is second to none. Keep up the good work .
Sir, It's fun learning with you. Thank you so much for making these awesome tutorials. I really loved it.
Sir this is over powered...thanks a ton!!😁😁
this is very useful and crystal clear video. thank u sir for best explaination.
great explanation sir
Thankyou !!
really good explanation. How easy it is. Thank you for great explanation
Amazing Sir, thank you for this valuable session.
you are magician sir too good sir Love from Indore
Thanks sir . You are a legend
Best Heap video ever.
Brilliant Explaining
Tussi great ho sir jee!!! bhagwan aapka bhala kare
Great explanation 👍
amazing explanation
Sir you are God + Gold ! Happy Teacher's Day.
Thank you beta!! gold to aap mujhe bnaooge achii placements lekrr
Awesome explanation..i have seen so many videos and even bought some courses..none of them was so crystal clear as this. Than You for all your efforts.
Beta sbka apna apna pdane ka tarika h aur jo jo faculities h hmare paas unhone mjhse zda bache place kraye h abhi tak, to I'll say that vo mjhse zda effort daalte h apne kaam main.
18:46 sir you are making amazing tutorials ! i have a doubt here, is it mandatory for the class Priority Queue to be static here ? actually i knew basics of c++ from school and this year i started android directly with kotlin , so have this doubt in java syntax.
next level explanation , thank you : )
Keep supporting with your comments
sir aap bahut awsome ho
U r a dhaansu teacher🙏🙏
Great Explanation!
Glad it was helpful!
Thanku for all the videos Sir
You are doing a really wonderful work for all the students
You really are inspiring many of us and we appreciate your work a lot
Thank you so much. If you like the content, please subscribe and share around in your college whatsapp groups.
@@Pepcoding already done sir
Seriously sir commendable job , first time thodi dikkat hui dimag me baithane me lakin second attemp me crystal clear sir
Bhot ache. Mehnat rang laegi
Best ever found on internet 👌
Thankyou beta!
I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem.
If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
Amzing tutorial sir 👍
Thankyou beta!
I am glad you liked it. If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
Really nice explanation sir.☺
Thankyou beta!
I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem. If you like our efforts, will you like to write a review about us here - g.page/Pepcoding/review?rc
Why are we assuming it to be a left child to the parent in upheapify()? It can be that the function is called with the last index element being a right child to its parent. Please help clarify. Thanks!
legend is back #sumit sir
neat!
Thankyou!
Keep learning and keep growing!😊
uttam sir
Wow👌👌maza a gaya👏🔥
I am glad you liked it. I also hope that you are watching till end and trying to understand the what, how and especially why of the problem.
If you like our efforts, we request a review
g.page/Pepcoding/review?rc
You can subscribe to our channel here
czcams.com/users/Pepcodingabout?view_as=subscriber
Already done sir
Ye data.size()-1 k chakkar me pure video me confuse raha mai 😅
But chalo end me sahi ho gaya. Awesome explanation sir.
For better experience, visit nados.pepcoding.com, where you will get well curated content and career opportunities.
indeed, this is a search ending video !!!
For better experience and well-organised content
Visit - nados.pepcoding.com
You can post your query on community tab.
Don't forget to follow us on Instagram
instagram.com/pepcoding/
Sir, if we want to remove elements in descending order then how will we write the compare to function?
return statement mei jo return kar rhe hai compareto function ki, uss output ko -1 se multiply kar do
@@Pepcoding ye to mergeKSorted mai descending order ke liye ho sakta hai, usme to Collections.reverseOrder() bhi use kar painge but sir is question mae descending ke liye upheapify aur downheapify mai signs hi change karne padenge na?
Up heapify ka logic galat hai sir, Parent ka index calculate krne me apne ye assume kr lia ki left child add hua hai...it is possible ki right child add hua ho...so pi = (i-2)/2 is also possible
floor value lenge na toh -1 and -2 dono ka cade cover ho jaega bcox when we divide it by 2 then .5 ka difference aayega and usme floor lene se cover ho jaega
Amazing.. simply the best..
Thankyou beta!
I am glad you liked it. I hope that you are watching the videos till the end. If you like our efforts, will you like to write a review about us here - g.page/Pepcoding/review?rc
waiting for hashmap implementation video sir
I have made it available. It is with the video-editting team. They will most likely post it 2mrw
sir ek video sirf comparator and comparable par bhi bana dijiye jaise aapne iterator and iterable par bnayi thi
bnai hui hai. Kal dalegi. Par wo thodi gobar bani hai. Dekhna ek baar, most likely wo replace karni padegi. Usme jyada repeat kia hai same point baar baar maine. Baaki sab theik hai. Kal aaegi.
@@Pepcoding No problem sir, repeat kia hai toh achi baat hai, dimaag mein set ho jaegi
Sir make a video on how to check is binary tree a heap
Ji, levelup ka question hai. dalega.
@@Pepcoding ji sir daliya pls thanks
When you are saying ‘higher value element have lower priority’ please say the reason behind this , as a hint.
downheapify mein toh base condition daali hee nahi hui hai ?
basically after swappings the recursion stops when either the current node has no children or it is smaller than both of its children, in which case no further swapping is needed and the method returns, effectively ending the recursion for that particular call.
Sir heap and hashmap ke questions portal pe upload karwa dijiye
hanji, aj ho jaenge.
zero is sacred place ...hahhaha best explanation ever
Thankyou beta!
I am glad you liked it. I also hope that you are watching till the end and trying to understand the what, how, and especially why of the problem. If you like our efforts, will you like to review us here - g.page/Pepcoding/review?rc
sir , hashmap ki implementaion ka video bhi do plss
han beta, mai bna chuka hun. video-editting team ke paas hai. kal dalega.
@@Pepcoding thank u so much sir
Sir dp on trees ki separate playlist will be helpful :-)
Will you upload it ?
Yes, sure. Ek baar enough volume ban jane dijie. Organise tarah tarah se kar denge.
Tree k chasma
Tough DP, GREEDY QUESTIONS
Aaega, aaega.