Minimize the Maximum Edge Weight of Graph | Detailed Intuition | BFS | DFS | Leetcode 3419 | MIK

[@codestorywithMIK]

🚨One Important Point - 🚨I should have mentioned above "threshold". There is a condition that "Each node has at most threshold outgoing edges." This condition doesn’t actually matter because, if it’s possible for every node to reach node 0, selecting just one edge per node is sufficient to ensure the graph remains connected.

[@Nitinrautindore]

I didn't understand Mike what you are trying to say...please elaborate it.

[@gui-codes]

@@Nitinrautindore Threshold wala condition dekho dhyan se. "Each node has at most threshold outgoing edges." Matlab kisi bhi node se zyada se zyada threshold edges jaane chaie. But tum notice karo ki kisi bhi node se tumhe 0 me jana hai to obviosuly ek outgoing edge enough hoga from the node. And constraint me dekho threshold ki value 1

[@jain5184]

Mik bhaiya want 2 things we the students are requesting u apka samjaya hua pura thought process dimag me jata hai even kabhi pehla consistent nhi tha apka subha motivation and then video thnku for all this but 1 apki sde sheet 2 dsa pattern recognition ispr video laao 3 for beginners to advance dsa course again ye app pr hai ki app launch karna chahta ho kuki honestly apka jesa ytber mene nhi dekha if u will for course jisme sabkuch included i will be infact bahut log course ke member hoga Again thanku if possible for u then it will be great help as u travel daily firbhi itna quality teaching content thought process salute u men 🫡

[@gauravmundhada1647]

Finally contest question! Personally I thought it of Kruskal variation

[@sahebraojadhav9727]

Thank u note for mik.really love u mere bhai❤❤❤❤

[@souravjoshi2293]

00:42 Goosebumps man. thanks a lot for working so hard for all of us

[@Dungeon550]

I really want to thank MIK sir due to him is that i can enjoy doing DSA problems ,his explaination are just song to ear. Small request from MIK sir if in the future he can share his knowledge and teach important concepts about Development

[@joydeepgharami403]

Thanks sir

[@Himanshhhhxu]

9:58 this was me😁 im still watching your video to get better understanding

[@codestorywithMIK]

❤️😇🙏

[@gui-codes]

bhai tumne 3rd Qn contest me solve karliya tha ?

[@Himanshhhhxu]

@@gui-codes yes

[@adityarawat3533]

motivation section is really good

[@PriyanshuTyagi-ts2uw]

I figured out the reversing of the edges and mst by myself, got confused in the threshold thing, thanks!

[@wearevacationuncoverers]

🎉 🎉 🎉 Contest qns. yayyyy

[@thefinancialdiet4458]

Sir please provide the DSA Sheet as soon as possible, it will be of great help.....and also make a video on how to build intution of the question..... many of us can solve question by seeing ur solution but cant make on our own.... Lots of Loveee sirrrrrr 💝💝💝💝💝💝💝💝💝💝💝💝💝💝💝💝💝💝💝💝💝

[@gui-codes]

yes MIK please

[@DevanshGupta-io7rl]

jeevan mai maza ab tab ayega jab aisa similar question khud se solve ho jaye live contest ya interview mai

[@bhupendrakalal1727]

mik sir abhi abhi just aaj ka constest virtually diya tha usme yahi sam equestion tha nhi bana mere se 😭😭😭😭 , please 4th one also

[@Scienceboy1214]

bhaiya, 4th one of today's contest please

[@bhupendrakalal1727]

bro 4th bana kya tumse???

[@RohitKumar-dz8dh]

Bhaiya agar time mile to leetcode 3413 problem ka bus approach note post kar dena na, isme sliding window interval k basis pe kese lagau samaj nahi a raha .

[@NobitaNarrro]

Thanks Bhaiya... it was asked in leetcode contest 432

[@aws_handles]

Thanks a lot. I could not solve this during contest.

[@KG-ts2cz]

Hey, I solved it using approach similar to Prim's algo after reversing the graph: class Solution { public: int minMaxWeight(int n, vector& edges, int threshold) { vector adj[n]; for(int i=0;i

[@KG-ts2cz]

Mik, This code got accepted on leetcode, but Prim's is designed for undirected graphs. Can you please tell in which scenario or test case this code might fail?

[@gui-codes]

Thank you so much for contest qn 😭

[@unknown47896]

yes bro🥹🥹

[@dayashankarlakhotia4943]

First 🎉❤

[@unknown__899]

❤️❤️

[@AYUSHMEHELDA]

please make videoes for leetcode contest 3rd and 4th problems in every week

[@italk-gj5kk]

please continue with contest solutions...

[@prathamagarwal7304]

sir is there no use of the threshold integer which is given?

[@codestorywithMIK]

Yes it is not required. Please do check the Pinned comment .

[@prathamagarwal7304]

@ Thank you Sir

[@somilplayzz9693]

Bhaiya maximum amount of robot can earn wale pr bhi bnado joh aaj ka 2 nd question tha contest ka

[@EB-ot8uu]

MIK, travel karte waqt to araam karlo 😄

[@bhupendrakalal1727]

mik bhaiya 1 st approacvh jo mere dimag me aay atha vo minimum spanning tree vala tha ki like udar se banau , kya us se ban skta h ye question????

[@gui-codes]

Nahi bhai. MST works for undirected graphs, where all edges are bidirectional. This problem involves a directed graph, and MST algorithms (like Kruskal's or Prim's) are not designed to handle directionality. Also, the problem explicitly states that all nodes must have a path to node 0. MST focuses on creating a spanning tree with the minimum total weight and doesn’t inherently ensure that all nodes are reachable from a specific node.

[@arjunkumaryadav8102]

Bhaiya...Aap please jitne bhi contest hote hai unke hard aur medium questions kare video lekar aaya kariye

[@arjunkumaryadav8102]

Bhaiya Hard questions ko kaise approach kare....wo to bante hi nahi

[@arjunkumaryadav8102]

Bhaiyya....kyu na main he karu ki kisi bhi ek node start karu aur kosis karu ki 0 node tak pahuch jao aur jab udhar se true return karu to mark karte jao ke ye node visited aur and finally agr visited array me sare node true ho jaye to visited nahi to nahi hai

[@codestorywithMIK]

Definitely you can try that. But when you start from any random node and try to reach 0, it’s not mandatory that you will cover all nodes.

[@rode_atharva]

sir maine c++ me bahut dsa kiya hai. laki mai har baar kuch na kuch syntax bhool jata hu. i know python as well. maine python me dsa karna start kiya hai. mujhe ye comfertable lag raha hai. concept ke liye to me apka hi chaneel follow carta hu bas GPT se code python me convert kr leta hu. please sir bataye kya me sahi kar raha hu python for dsa leke ???. ha lekin c++ karna weste nahi kuki bahut se solution mil jate hai c++ mai

[@imPriyansh77]

dsa is language independent...you should be able to come up with a logic

[@DevanshGupta-io7rl]

bhaiya ye to aagya smajh mai but live contest mai kaise itta strike krega wo bata dijiye kaise improve kru ???

[@ParwezAlam-lj7qx]

but you didn't consider the third condition (threshold outgoing edges) what about this. please explain

[@codestorywithMIK]

Please do see the Pinned comment ❤️

[@harsh_dhakad_Gamer]

Sir in this question what js the use of that threshold U donot use that So why ?

[@codestorywithMIK]

Hi Harsh, Please check the Pinned comment above ❤️😇🙏

[@harsh_dhakad_Gamer]

@codestorywithMIK yes thanks sir 🩷

[@siikedia]

what about threshold?

[@aws_handles]

Because anyways we are removing edge. So, there is no chance of increasing the outgoing edges. Every time we remove edge, the outgoing edge is always reduced and hence will never cross the threshold.

[@bhupendrakalal1727]

it is getting handled automaticaaly already

[@gui-codes]

see the pinned comment bro

[@sujalmahajan9673]

Although solved the problem but I have a doubt in it. Why threshold is not affecting the answer in actual

[@codestorywithMIK]

Kindly check the Pinned comment ❤️

[@siikedia]

do 3404. Count Special Subsequences

[@sahebraojadhav9727]

Guys can u tell me why my code giving TLE class Solution { public: void makeDfs(int start,unordered_mapgraph,int maxDist,vector&visited){ visited[start]=true; for(auto &pr:graph[start]){ int dest=pr.first; int dist=pr.second; // cout

[@pinakvyas1779]

you didnt checked threshold

[@aws_handles]

Because anyways we are removing edge. So, there is no chance of increasing the outgoing edges. Every time we remove edge, the outgoing edge is always reduced and hence will never cross the threshold.

[@gui-codes]

see the pinned comment bro

[@bhupendrakalal1727]

mik bhaiya 1 st approacvh jo mere dimag me aay atha vo minimum spanning tree vala tha ki like udar se banau , kya us se ban skta h ye question????

[@gui-codes]

Nahi bhai. MST works for undirected graphs, where all edges are bidirectional. This problem involves a directed graph, and MST algorithms (like Kruskal's or Prim's) are not designed to handle directionality. Also, the problem explicitly states that all nodes must have a path to node 0. MST focuses on creating a spanning tree with the minimum total weight and doesn’t inherently ensure that all nodes are reachable from a specific node.

[@bhupendrakalal1727]

@@gui-codes thank u bro

[@bhupendrakalal1727]

@@gui-codes bro can we connect on insta or any other social media??

[@KG-ts2cz]

My code for Prim's got accepted after I reversed the graph and started from 0