Diameter Of Undirected Graph | Tree Diameter | Leetcode 1245 | Graph Concepts & Qns - 44 | MIK

[@NikhilYadav-i2f]

Feels so honoured that He is my college alumni, absolute goated stuff Bhaiya🦾

[@codestorywithMIK]

This means a lot ❤️🙏

[@NikhilYadav-i2f]

@@codestorywithMIK Can we connect by any means, Bhaiya? Need some advice regarding tech stuffs and hiring, this year has been drastic for us with regards to internship and placement.

[@codestorywithMIK]

NOTE - The diameter of a tree or graph represents the longest path between any two nodes, and this path does NOT contain any REPEATED edges or nodes. Today's POTD Link - kzbin.info/www/bejne/q6vCiHyJpd6GfNU

[@ShivamSharma-vf4uf]

SIR PLEASE SOLVE 21 DEC AND 22 DEC Problem of the day as you skipped these problems on that day

[@sumitgupta310]

Leetcode : 3203 (using video Explaination) sol : class Solution { public: pair bfsTofindFarthestNode(int s, int v, unordered_map& adj) { vector vis(v, false); queue q; q.push(s); vis[s] = true; // Mark starting node as visited int level = 0, farthestNode = s; while (!q.empty()) { int n = q.size(); for (int i = 0; i < n; i++) { int node = q.front(); q.pop(); farthestNode = node; for (auto it : adj[node]) { if (!vis[it]) { vis[it] = true; // Mark neighbor as visited before enqueueing q.push(it); } } } if (!q.empty()) level++; } return {farthestNode, level}; } int treeDiameter(vector& edges) { int v = edges.size() + 1; // Number of nodes unordered_map adj; for (const auto& edge : edges) { int u = edge[0], v = edge[1]; adj[u].push_back(v); adj[v].push_back(u); } auto oneEndNode = bfsTofindFarthestNode(0, v, adj); auto otherEndNode = bfsTofindFarthestNode(oneEndNode.first, v, adj); return otherEndNode.second; // Diameter of the tree } int minimumDiameterAfterMerge(vector& edges1, vector& edges2) { int dia1 = treeDiameter(edges1); int dia2 = treeDiameter(edges2); int combinedDia = ceil(dia1 / 2.0) + ceil(dia2 / 2.0) + 1; return max({dia1, dia2, combinedDia}); } };

[@gui-codes]

Done and crystal clear. These concepts I was not even taught in a paid course I took years ago. I wish I had found you earlier. Waiting for today's POTD now.

[@aws_handles]

Man you are a legend and so hard working. Thank you for clearing the concepts. Now I can understand the POTD

[@Abraham33286]

Your explanation is unbeatable.

[@SiddheshPardeshi-mp9cr]

Amazing explanation, Keep the good work

[@abhinay.k]

20:14

[@I_Love_You_Mansi_Forever]

mik sir you are so underrated!!

[@k-CE-OmkarPathak]

Great concepts

[@Coder_Buzz07]

First view😍❤

[@gui-codes]

Wow. Thanks a lot MIK. Was waiting for this one.

[@metirajendar6396]

What if the node 5 has two child nodes(say 10 and 11) in the dry run? Do we get multiple options for diameters? How does this effect the diameter paths(having multiple paths with diameter k)?

[@varunaggarwal7126]

I made silly mistakes during oa rounds due to stress, later I was able to solve 😭😭

[@abhinay.k]

Thanks sir

[@vaibhavyadav3301]

Bro your whole content is aroud dsa and leetcode, you should take the premium again 😅

[@anshuman5554]

Sir, expedia group USA ke liye refer kr skte ho kya? i am doing my masters here

[@amardeep7714]

MIK , plz 1 vdeo on Bridge of graph....i knw ki dfs s hoga ..time stamp discovery and finish time ka concept h but still achhe s clear nai hua h...so plz try to bring that too.. Also i am placed in campus in PSU with 21 ctc. Thankyou so much for everything .

[@ShivamSharma-vf4uf]

SIR PLEASE SOLVE 21 DEC AND 22 DEC Problem of the day as you skipped these problems on that day @codestorywithMIK

[@RishabhChatterjee-fg2gz]

Bhaiya mathematical proof wala ek baar firse samjha do, Aur Bhaiya d(u,a) > d(u,b) ho sakta hai aap jo diagram liye uske basis pe aagar mein u ko b se 1 distance pe rakhu, ye wala thik se samajh nhi aaya, mathematical wala ek baar aur Bhaiya please

[@ashutoshchouhan9610]

14:24 🔔 vo yaha kisa lye karaga 😂😂🤣

[@aadityaraj2397]

ye question CSES sheet me bhi hai

[@yogendrakesharwani3650]

I am not able to search for leetcode POTD section. Where is that section ?

[@codestorywithMIK]

kzbin.info/www/bejne/q6vCiHyJpd6GfNUsi=btJ8DB81bcdJITlu

[@pradeepgpt]

Its daily challenge problems, You can find in the right side of the problem section.(Looks like calendar)

[@varunpalsingh3822]

MIK ek roadmap bana sakte ho ? How to get good tech job in 2025 I sometimes got distract from my path ki what how and where to do

[@HeetVichhivora]

Mik bhaiya perso ka video please

[@anshkapooriitb6458]

2940. Find Building Where Alice and Bob Can Meet solution video please

[@codestorywithMIK]

coming today.

[@sarangkale6761]

Sir Aaj POTD nhi solve karenge?

[@codestorywithMIK]

Definitely it will come. But before solving today's POTD, this video is going to be very important. Do watch this one because we will directly use the code of this video to today's POTD.

[@sarangkale6761]

@codestorywithMIK yess sir

[@meetdobariya8777]

Last two days