Divide Nodes Into the Maximum Number of Groups | Leetcode 2493

This video explains Divide Nodes Into the Maximum Number of Groups problem using the most optimal bipartite graph solution using BFS.
----------------------------------------------------------------------------------------------------------------------------------------------------------------
🟣 JOIN our 𝐋𝐈𝐕𝐄 𝐢𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 𝐭𝐫𝐚𝐢𝐧𝐢𝐧𝐠 𝐩𝐫𝐨𝐠𝐫𝐚𝐦 through whatsapp query: [phone]
🟣 𝐂𝐡𝐞𝐜𝐤𝐨𝐮𝐭 𝐚𝐥𝐥 𝐨𝐮𝐫 𝐂𝐨𝐮𝐫𝐬𝐞𝐬: techdose.co.in/
🔵 LinkedIn: / surya-pratap-kahar
🔴 INSTAGRAM: / techdose_official
🟢 𝐓𝐞𝐜𝐡𝐝𝐨𝐬𝐞-𝟏𝟎𝟎 𝐬𝐡𝐞𝐞𝐭: docs.google.co...
---------------------------------------------------------------------------------------------------------------------------------------------------------------
Possible Bipartition: • Possible Bipartition |...
𝐂𝐎𝐃𝐄 𝐋𝐈𝐍𝐊: gist.github.co...

[@kaushikelangovan3109]

I initially went through Neetcode's solution, I thought I understood everything he was explaining, but end of the video, I was stuck not knowing where to begin. Now after going through your video solution, you make it easy to understand what to exactly do for a problem step by step and I am even confident enough to even teach someone else how to solve this problem. Just brilliant, how you break down a complex problem into smaller sub-problem and explain it in detail. Thank you for this!

[@techdose4u]

welcome :)
Putting some effort before actually explaining

[@Anikait-h3d]

coming up with such logic is genius. By just seeing HARD written beside the question i feel like quitting

[@techdose4u]

Keep going man 💪

[@freecourseplatformenglish2829]

Thanks man, as always I am out of words to appreciate how well you explained everything.

[@techdose4u]

welcome 🙏🏼

[@fellowviber7792]

i always appreciate when you mention similar problems and give overview about prerequisites

[@techdose4u]

I'm glad you find that helpful!

[@BhagyaRana]

Crystal Clear 🔥 Explaination! 👌🏻 Thank you TechDose for Superb Explaination 🔥👏🏻👏🏻! Quality of Content++!

[@techdose4u]

Thanks for the appreciation 🙏🏼

[@Abhishek-e6d2c]

How can someone be so good at explaining!!

[@techdose4u]

by god’s grace 🙏🏼
Thanks for your appreciation

[@levimatheri7682]

I tried to read the editorial on leetcode and didn't quite get it. Then came here and now it all makes sense! Great job TechDose

[@techdose4u]

Thanks

[@sriyashmishra5257]

Superb explaination ❤

[@techdose4u]

Thanks :)

[@maheshgnayak5721]

Great video! Thank you!

[@techdose4u]

welcome :)

[@hariharan-kn1km]

Thank You Sir

[@techdose4u]

welcome

[@sailendrachettri8521]

Thank you sir :)

[@techdose4u]

You're welcome :)

[@johndurai2226]

brilliant sir

[@techdose4u]

Thanks :)

[@shivnathkahar8985]

Nice

[@techdose4u]

👍🏼

[@farhanahmad1731]

Why finding diameter of each component will not work here ?

[@farhanahmad1731]

my bad, the graph can be cyclic here. So we can't directly find the diameter as we do for acyclic graph

[@techdose4u]

Its not a tree but graph :)

[@divyasingh6771]

java code is not there in code file

[@fellowviber7792]

use chatgpt to translate it , it's easy to get c++ to java translated

[@techdose4u]

Thanks for reminder.
Updated Java & Python codes

[@kartikrastogi1069]

sir it is giving TLE

[@techdose4u]

it’s working fine.
maybe you have missed dfs visited maker somehow.
you need to revisit and match line by line

[@sumitkumar-bb7kv]

thanks sir , we can calculate diameter in step 3 of algo which reqires only 2 bfs passes ,

[@techdose4u]

yes
but finding diameter and using bfs may not always be correct.

[@AkshSV-2030]

n = 16
[[16,8],[6,5]]
Expected: 16
could you explain how??? 16

[@techdose4u]

bacause there are 16 nodes.
Each node not having edge forms separate separate groups.
Here 12 nodes are alone so 12 groups for that.
Next you have 4 groups for nodes mentioned in edgelist.

[@fellowviber7792]

The graph has two disconnected parts
>One part connects nodes 16 and 8
>The other part connects nodes 6 and 5
Since, these parts are separate and have no connections to each other, we can assign each node to its own group without breaking the rule that connected nodes must be in adjacent groups. because there are no extra constraints every node can be in a unique group
This means the maximum number of groups is 16 which is total number of nodes.