Number of Provinces Leetcode solution | DFS Graph Explained Hindi | Graph in Data structure & Algo

This is the video under the series of DATA STRUCTURE & ALGORITHM in a GRAPH Playlist. Now we are going to solve the Number of Provinces | Graph series
Join My Telegram channel for more Updates: telegram.me/he...
complete DSA preparation: github.com/Pri...
----------------------------------------------------------------------------------------
Number of Provinces: leetcode.com/p...
code in this video: github.com/Pri...
----------------------------------------------------------------------------------------
*Follow me *
LinkedIn► / iamprince
Facebook► / helloworldofficials
Instagram► / helloworldbyprince
Twitter► / prince_king_
Telegram► telegram.me/he...
----------------------------------------------------------------------------------------
►Our Playlists on:-
► Tree: • Tree Data Structure & ...
► Hashing: • Hashing Data Structure...
► Graph: • Graph Data Structure &...
► Matrix: • Matrix (Multidimension...
► STL: • Standard Template Libr...
► Leetcode: • LeetCode Solutions And...
►Competitive Programming: • Full course in Competi...
►C++ Full Course : • C++ full Course in HINDI
►Algorithms: • L-01 || Prefix Sum Arr...
►Data Structure: • Data Structures with C...
------------------------------------------------------------------------
🌟 Please leave a LIKE ❤️ and SUBSCRIBE for more AMAZING content! 🌟
✨ Tags ✨
leetcode problems
leetcode problems java
leetcode problems python
leetcode problems that got me tired
leetcode problems c++
leetcode problems and solutions python
leetcode problems playlist
leetcode problems and solutions java
leetcode problems in Hindi
leetcode problems javascript
leetcode problems and solutions
leetcode problems of the day
leetcode problems for beginners
leetcode problems easy
leetcode problems js
Introduction to the graph data structure
Graph playlist Hello world
Shortest Path in Unweighted Graph
Print all paths from a given source to a destination
Depth First Search
Graph hello world
Types of graphs in Data structure & algorithms
DFS Graph
playlist Graph Hindi
Number of Provinces leetcode
Number of Provinces solution
question asked in Google
off-campus placement
how to learn to code for beginners
Practice Tree data structure
Unit Area of the largest region of 1's
The graph in a data structure in Hindi
Graph Full playlist for Beginners
algorithms
graph
Number of Provinces
data structure
sorting algorithms
algorithm analysis
Rotting Oranges
gate computer science preparation
programming languages
#Graph #Leetcode #programming

[@cs_in_10_minutes]

bhaiyya, iske pahle ke saare videos dekhe the maine, to ye video bas open kiya, question ki link me gaya, thodi der socha aur khud se ban gaya dfs se. Thanks guru ji

[@pritishpattnaik4674]

first i converted the adjacency matrix to adjacency list and then took a counter variable and incremented in the for loop the number of times the dfs is called

[@oqant0424]

your graph series boosted my confidence to a next level

[@HelloWorldbyprince]

Thanks a ton Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@ani68]

After watching all the 25 lectures before this...I was able to code it myself...thanks bhaiya💯

[@HelloWorldbyprince]

Amazing yaar

[@idiot8950]

bhak paagal mat bana copy kiya hoga code

[@ani68]

@@idiot8950 tereko nahi ata aisa bol na

[@idiot8950]

@@ani68 bhaag saale noob coder

[@ashishverma1382]

aaj maine aapka pahala video dekha aur wo dil ko chu gaya

[@HelloWorldbyprince]

Thanks 😊

[@rahulgautam6387]

Thanks bro for your good lectures , I solve this question on single attempt without watching your solution....

[@HelloWorldbyprince]

Well done

[@anushka23429]

aapki videos bohot helpful hai. thank you sir

[@kuldeepchouhan8467]

Amazing explanation!! Prince bro you rock!!

[@HelloWorldbyprince]

Thanks a ton

[@CodeLearnIit]

thank you very much sir for providing these amazing lecture

[@HelloWorldbyprince]

It's my pleasure
Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@shailesh2064]

thanks sir now i finally solve problem in my own this playlist is awesome i almost finished it

[@HelloWorldbyprince]

You are most welcome

[@user-uc2pl1or2x]

class Solution {
public:
void dfs(unordered_map& adj, unordered_set& visited, int node) {
visited.insert(node);
for (int neighbor : adj[node]) {
if (visited.count(neighbor) == 0) {
dfs(adj, visited, neighbor);
}
}
}
int findCircleNum(vector& isConnected) {
unordered_map adj;
unordered_set visited;
for (int i = 0; i < isConnected.size(); i++) {
for (int j = 0; j < isConnected[0].size(); j++) {
if (isConnected[i][j]) {
adj[i].push_back(j);
adj[j].push_back(i); // Add the reverse edge for an undirected graph
}
}
}
int count = 0;
for (int i = 0; i < isConnected.size(); i++) {
if (visited.count(i) == 0) {
dfs(adj, visited, i);
count++;
}
}
return count;
}
};

[@paper-studio]

there is actually no need to create a separate adj vector, you can check the condition of not visited in the first loop itself

[@anonymous090]

I have done it on my own. Thank you so much bhaiya..
so happppyyyy😁❤

[@HelloWorldbyprince]

Most welcome 😊
Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@anonymous090]

@@HelloWorldbyprince sure 😇

[@tanveeralam3971]

One of the best teacher on internet ❤️

[@HelloWorldbyprince]

Thanks Tanveer

[@sus_tha_coder]

Nice explanation bhaiya... Sare basic concepts ke hi basis pe questions ke logic bn rhe h...thnx...

[@HelloWorldbyprince]

share please
and I am happy its worked

[@programmingrush]

your motivation is first 2:31 made me solve the problem on my own. Thank you

[@HelloWorldbyprince]

Yeah ... bass yahi sunnaa tha
Please, if possible then share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@programmingrush]

@@HelloWorldbyprince yes ofcourse

[@pritishpattnaik4674]

bhai done by own
please check it's correct or not
My approach :
void dfs(int node, vector adj[], vector &vis){
vis[node] = true;
for (auto x : adj[node]){
if (vis[x] == false){
dfs(x, adj, vis);
}
}
}
int findCircleNum(vector& isConnected) {
int n = isConnected.size();
vector adj[n+1];
for (int i=0 ; i

[@pritishpattnaik4674]

thanks Prince bhai , u gave me confidence to solve the graph questions

[@amankumar-ig2fe]

best sir ji

[@HelloWorldbyprince]

Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@realAB459]

Great Video...Thanks..Please keep on making such series

[@HelloWorldbyprince]

Thanks, will do!

[@realAB459]

@@HelloWorldbyprince A series on Greedy and Bit Manipulation will be very helpful...Greedy playlist is not there in youtube.

[@shadaabkhan4608]

Thanks bhyya awesome videos

[@abhineetsingh6720]

bhai yeh number of islands wale question ki tarah dikh raha, usse kaise alag hai?

[@SaurabhSingh-ch6nc]

I think we don't need to create the adjacency list.
we can do this without it.

[@akankshagupta2312]

thank you bhaiya

[@HelloWorldbyprince]

Keep growing and learning

[@indianview6103]

Nice Explanation! can you please also explain complexity of this solution?

[@HelloWorldbyprince]

same as DFS one

[@MakeuPerfect]

nice bhaiya

[@HelloWorldbyprince]

Thanks a ton buddy

[@sumitbaghel9987]

Great vid!

[@HelloWorldbyprince]

Thanks please share bro Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@pranavkorhale5089]

//Code by DFS
//User function Template for Java
class Solution {
static int numProvinces(ArrayList adj, int V) {
ArrayList []arr = new ArrayList[V];

for(int i=0;i

[@pranaymishra5456]

Ranchi 🙋🏻

[@HelloWorldbyprince]

Nice bro

[@anshumantripathi5747]

sir aap ranchi se ho kya

[@shadabkalim9102]

even i live in ranchi pls tell me where u live i want to meet u big fan

[@HelloWorldbyprince]

sure we will meet in ranchi

[@oqant0424]

26/32 done

[@HelloWorldbyprince]

amazing

[@jayeshyadav07]

count the number of disconnected components

[@HelloWorldbyprince]

yesss

[@theedit9028]

Hi bhaiyaa i make youtube thumbnails and i also want to for you so are you intrested ?

[@HelloWorldbyprince]

connect over me instagram @helloworldbyprince

[@idiot8950]

agar college me share karenge toh sab padh lenge toh ham piche ho jaaenge

[@HelloWorldbyprince]

Hahaha

[@idiot8950]

saari information khud hi lenge

[@HelloWorldbyprince]

nhiiiiiiiiii,
share v kar dena