Map of Highest Peak | Leetcode 1765

This video explains Map of Highest Peak using the most optimal multi source bfs.
----------------------------------------------------------------------------------------------------------------------------------------------------------------
🟣 JOIN our 𝐋𝐈𝐕𝐄 𝐢𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 𝐭𝐫𝐚𝐢𝐧𝐢𝐧𝐠 𝐩𝐫𝐨𝐠𝐫𝐚𝐦 through whatsapp query: [phone]
🟣 𝐂𝐡𝐞𝐜𝐤𝐨𝐮𝐭 𝐚𝐥𝐥 𝐨𝐮𝐫 𝐂𝐨𝐮𝐫𝐬𝐞𝐬: techdose.co.in/
🔵 LinkedIn: / surya-pratap-kahar
🔴 INSTAGRAM: / techdose_official
🟢 𝐓𝐞𝐜𝐡𝐝𝐨𝐬𝐞-𝟏𝟎𝟎 𝐬𝐡𝐞𝐞𝐭: docs.google.co...
---------------------------------------------------------------------------------------------------------------------------------------------------------------
𝐂𝐎𝐃𝐄 𝐋𝐈𝐍𝐊: gist.github.co...

[@xlr8tanmay]

Thanks a lot for your explanations. I am able to see myself improve day by day..

[@techdose4u]

great

[@akashdeshpande4350]

Thanks!

[@techdose4u]

welcome

[@shyamaharihar2425]

Great explanation thankyou !

[@techdose4u]

welcome

[@programming6177]

Thank you bro😇

[@techdose4u]

welcome :)

[@vlnsrikanth3242]

Thank you so much! Its crtystal clear!

[@techdose4u]

great

[@sailendrachettri8521]

Thank you sir :)

[@techdose4u]

welcome :)

[@Jarvie0715]

This problem is very similar to 407 Trapping Rain Water II several days ago. When should we use a queue and when should we use a min heap?

[@techdose4u]

queue for levelorder minheap for greedy shortest path type

[@alessandrocamilleri1239]

Both could be used in this case. However there is no need for the priority queue since heights are always increasing by 1 and level order bfs would do just fine.

[@WebDevAnjali]

i feel so dumb at dsa that i can't come up with these solutions on my own it's been around 4 months since i started my leetcode journey it feels like i'm wasting my time.

[@techdose4u]

It will take a lot of time. It is an advance concept, not a simple BFS. Maybe anyone will talk & show that its simple but believe me it is not.

[@chanakyay3822]

sir , do you solve it on first try for all the daily problems? will you get struck or take any help? i am trying very hard daily sir , i can solve few and could'nt few , for this questuon i did not get the intution at all.

[@techdose4u]

it is not easy at all. This is similar to rotten oranges problem. only if you can recall its simple else hard.

[@shivyanshgarg2641]

Sir, If you have time, Please upload problem D solutions of the contests as well Video Request for-> 3430. Maximum and Minimum Sums of at Most Size K Subarrays

[@techdose4u]

Currently we are only following daily challenges due to time constraint.

[@shivnathkahar8985]

Nice

[@techdose4u]

thanks

[@Anikait-h3d]

just a easy version of leetcode daily saturday ka. Could do this easily because of ur previous explanation.

[@techdose4u]

nice

[@Gautamkumar-ys6hc]

This problem looks similar to rotten orange problem

[@techdose4u]

exactly. i forgot to mention that in the video :)

[@Shubhammi1100]

bro use hinglish like codestorywithmik

[@techdose4u]

Sorry, it will always be english here :)