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

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

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; }

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

Good explanation 👏 🎉

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

Thank god. Video came.

thnx 😇

Thanks ma'am

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

for me light mode was better

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

is time complexity of dfs is o(n2)?