10. Most people do this by DFS only | BFS DFS-C++,JAVA | LeetCode 547-No of Provinces with Intuition

[@dayashankarlakhotia4943]

Good explanation 👏 🎉

[@sharatpaul]

Please use white pen instead of red since the background is black

[@harshav4704]

Mam this is really a good and simple one and i was able to do following your dfs lecture logic. Thanks keerti mam.😀👍🏻

[@rajendiranvenkat5992]

Thank god. Video came.

[@Raj10185]

Awsome video mam, I finally did the bfs code for this problem

[@sudiptosaha7467]

Can be done using BFS. I tried this way -
int NumProvinces(vector & adjMat)
{
q.push(0);
for (int j = 0; j < numNodes; j++)
{
if (!visited[j]) {
while (!q.empty())
{
int curr = q.front();
q.pop();
for (int i = 0; i < numNodes; i++)
{
if (adjMat[curr][i] && !visited[i])
{
q.push(i);
visited[i] = true;
}
}
}
numProvince++;
}
}
return numProvince;
}

[@surajprakashsinghh]

isme naya kaya hai

[@bluebirdclub092]

thnx
😇

[@adeshrukmangad9040]

Can be done using BFS as well

[@Aarya985]

Thanks ma'am

[@nithiin7]

Teach us problems which are application of graph that can't be identified on first sight that is an application of graph

[@KeertiPurswani]

Yup! Will teach everything! Be patient! Hope you watched the last video! That was one such question!

[@amanverma8097]

for me light mode was better

[@shwetabansal2202]

Do you have any upcoming series on string/trie related questions ?

[@avinashtiwari4025]

is time complexity of dfs is o(n2)?

[@surajprakashsinghh]

yes, O(n^2)