Please use white pen instead of red since the background is black
@harshav4704
7 ай бұрын
Mam this is really a good and simple one and i was able to do following your dfs lecture logic. Thanks keerti mam.😀👍🏻
@dayashankarlakhotia4943
7 ай бұрын
Good explanation 👏 🎉
@Raj10185
7 ай бұрын
Awsome video mam, I finally did the bfs code for this problem
@rajendiranvenkat5992
8 ай бұрын
Thank god. Video came.
@adeshrukmangad9040
8 күн бұрын
Can be done using BFS as well
@nithiin7
8 ай бұрын
Teach us problems which are application of graph that can't be identified on first sight that is an application of graph
@KeertiPurswani
8 ай бұрын
Yup! Will teach everything! Be patient! Hope you watched the last video! That was one such question!
@sudiptosaha7467
5 ай бұрын
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
3 ай бұрын
isme naya kaya hai
@Aarya985
7 ай бұрын
Thanks ma'am
@shwetabansal2202
7 ай бұрын
Do you have any upcoming series on string/trie related questions ?
Пікірлер: 17