Minimum Obstacle Removal to Reach Corner | Leetcode 2290

This video explains Minimum Obstacle Removal to Reach Corner using the most optimal Dijkstra algorithm using BFS and greedy minheap data structures.
----------------------------------------------------------------------------------------------------------------------------------------------------------------
🟣 JOIN our 𝐋𝐈𝐕𝐄 𝐢𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 𝐭𝐫𝐚𝐢𝐧𝐢𝐧𝐠 𝐩𝐫𝐨𝐠𝐫𝐚𝐦 through whatsapp query: [phone]
🟣 𝐂𝐡𝐞𝐜𝐤𝐨𝐮𝐭 𝐚𝐥𝐥 𝐨𝐮𝐫 𝐂𝐨𝐮𝐫𝐬𝐞𝐬: techdose.co.in/
🔵 LinkedIn: / surya-pratap-kahar
🔴 INSTAGRAM: / techdose_official
🟢 𝐓𝐞𝐜𝐡𝐝𝐨𝐬𝐞-𝟏𝟎𝟎 𝐬𝐡𝐞𝐞𝐭: docs.google.co...
---------------------------------------------------------------------------------------------------------------------------------------------------------------
𝐂𝐎𝐃𝐄 𝐋𝐈𝐍𝐊: gist.github.co...

[@21flame72]

Thankyou sir , hard problems really hard i need to improve my self in graph and tree

[@techdose4u]

This was difficult

[@AcashBrands]

nice explanation sir

[@techdose4u]

Thanks and welcome

[@sailendrachettri8521]

Thank you so much sir :)

[@techdose4u]

Most welcome!

[@patilrajesh2500]

Lecture successfully completed on 28/11/2024 🔥🔥

[@techdose4u]

nice :)

[@KareemAshraf91]

Keep up the good job bro!🔥

[@techdose4u]

Thanks 💯

[@MAHALAKSHMIVEERARAJ]

Hi Sir, After I read this problem, I guessed it is a DP problem. How to improve the ability to correctly guess the method solving problem? I solved lot more problems but when seeing new problem, I am failing to identify the correct method 😞Could you please help me with this query? Thank you so much!

[@techdose4u]

I guess you thought of each obstacle be taken or not taken type.
You need to encounter more such situations to sharpen your skills :)

[@153shrinaths5]

Please compile all the daily videos into month wise playlist so that it will be useful for us to revise. Also please provide related youtube video links in description of each video. @techdose

[@techdose4u]

Compiling all in a sheet.
will soon make it available as soon as the new website is launched

[@shivnathkahar8985]

Excellent video

[@techdose4u]

thanks :)

[@abhivardhan395]

Bestttttt.......🤍

[@techdose4u]

Thanks :)

[@NitishKumar-vi7sq]

At first, I thought of using DP+Recursion, but it won't work. Why so??

[@techdose4u]

Dijkstra is a greedy technique.
DP can solve but will get TLE.

[@NitishKumar-vi7sq]

@techdose4u got it. Thanks