id int64 1 3.58k | problem_description stringlengths 516 21.8k | instruction int64 0 3 | solution_c dict |
|---|---|---|---|
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 2 | {
"code": "class Solution {\npublic:\n int find(vector<int> &rank, int x) {\n if(x != rank[x])\n return rank[x] = find(rank, rank[x]);\n return rank[x];\n }\n\n void unionSet(vector<int> &rank, int x, int y) {\n int px = find(rank, x);\n int py = find(rank, y);\n\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 2 | {
"code": "\nclass DisjointSet\n{\nprivate:\n vector<int> size, parent, rank;\n\npublic:\n DisjointSet(int size)\n {\n this->size.resize(size + 1, 1);\n this->rank.resize(size + 1, 0);\n\n for (int i = 0; i <= size; i++)\n {\n this->parent.push_back(i);\n }\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 2 | {
"code": "class Solution {\n \npublic:\n \n int find_par(int u,vector<int>& par){\n if(u == par[u]) return u;\n else return par[u] = find_par(par[u],par);\n }\n void make_union(int u,int v,vector<int>& par,vector<int>& rank){\n int pu = find_par(u,par);\n int pv = find_par(v... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 2 | {
"code": "class Solution {\npublic:\n int a[100005];\n int par(int v) {\n if (a[v] == v) return v;\n return par(a[v]);\n }\n int makeConnected(int n, vector<vector<int>>& c) { \n int m = c.size();\n if (m < n - 1) return -1;\n for (int i = 0; i < n; ++i) a[i] = i;\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 2 | {
"code": "class DisjointSet{\npublic:\n vector<int> parent;\n vector<int> rank;\n \n DisjointSet(int n){\n parent.resize(n);\n rank.resize(n,0);\n for(int i=0;i<n;i++){\n parent[i] = i;// self parent\n }\n }\n\n int findParent(int node){\n if(parent[nod... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 2 | {
"code": "class DisjointSet {\n vector<int> rank, parent, size; \npublic: \n DisjointSet(int n) {\n rank.resize(n+1, 0); \n parent.resize(n+1);\n size.resize(n+1); \n for(int i = 0;i<=n;i++) {\n parent[i] = i; \n size[i] = 1; \n }\n }\n\n int findU... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 2 | {
"code": "class Solution {\n\n class Disjointset{\n vector<int>parent, size;\n public:\n Disjointset(int n){\n parent.resize(n+1, 0);\n size.resize(n+1, 1);\n for(int i=0; i<=n; i++){\n parent[i]=i;\n }\n }\n int findUpa... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 2 | {
"code": "class Solution {\npublic:\n class DisjointSet{\n public:\n vector<int> parent,rank,size;\n DisjointSet(int n) {\n parent.resize(n);\n rank.resize(n,0);\n size.resize(n,1);\n for(int i=0;i<n;++i) parent[i] = i;\n }\n int getpa... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 2 | {
"code": "vector<int> edges[100005];\nbool vis[100005];\n\nclass Solution {\nprivate: \nvoid dfs(int x){\n vis[x] = 1;\n\n for(auto e: edges[x]){\n if(!vis[e])dfs(e);\n }\n}\npublic:\n int makeConnected(int n, vector<vector<int>>& connections) {\n\n int totalEdges = connections.size();\n\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 2 | {
"code": "class DisjointSet{\n //o(4*alpha)\n vector<int>rank,parent,size;\npublic:\n DisjointSet(int n){\n rank.resize(n+1,0);\n parent.resize(n+1);\n size.resize(n+1,1);\n for(int i =0;i<=n;i++) parent[i] = i;\n }\n int findUpar(int n){\n if(n==parent[n]) return n;... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\n\n class Disjoint_set\n{\nprivate:\n /* data */\npublic:\n vector<int> rank, parent, size;\n\n Disjoint_set(int n)\n {\n rank.resize(n + 1, 0);\n size.resize(n + 1, 1);\n parent.resize(n + 1, 0);\n for (int i = 0; i <= n; i++)\n {\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n void dfs(int curr,vector<bool>&visited,vector<vector<int>>&grid)\n {\n visited[curr]=true;\n for(auto neighbour:grid[curr])\n {\n if(!visited[neighbour])\n dfs(neighbour,visited,grid);\n }\n }\n int find(int curr, vec... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class dsj {\n public:\n vector<int> parent , rank;\n int n;\n\n dsj(int v) {\n n = v;\n for(int i = 0;i<v;i++) {\n parent.push_back(i);\n rank.push_back(0);\n }\n }\n\n int findParent(int x) {\n if(x == parent[x]) {\n return x;\... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class DSU\n{\n public:\n vector<int>parent,size;\n DSU(int n)\n {\n parent.resize(n+1);\n size.resize(n+1,1);\n for(int i=0;i<n;i++)parent[i]=i;\n }\n int find(int node)\n {\n if(node==parent[node])return node;\n else return parent[node]=find(parent[n... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n vector<int> rank;\n vector<int> par;\n int find(int x) {\n if(x == par[x]) {\n return x;\n }\n par[x] = find(par[x]);\n return par[x];\n }\n int union_by_rank(int x, int y) {\n x = find(x);\n y = find(y);\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n int findPar(int u, vector<int>&par){\n if(u==par[u]) return u;\n return par[u]=findPar(par[u],par);\n }\n int makeConnected(int n, vector<vector<int>>& connections) {\n vector<int>adj[n];\n vector<int>par(n);\n for(int i=0;i<n;i++)\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class DisjointSet {\n \npublic:\n vector<int> rank, parent, size;\n DisjointSet(int n) {\n rank.resize(n + 1, 0);\n parent.resize(n + 1);\n size.resize(n + 1);\n for (int i = 0; i <= n; i++) {\n parent[i] = i;\n size[i] = 1;\n }\n }\n\n in... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n // void dfs(int node, vector<int> adj[], vector<bool>& visited) {\n\n // visited[node] = true;\n\n // for (int i : adj[node])\n // if (!visited[i])\n // dfs(i, adj, visited);\n // }\n\n int makeConnected(int n, vector<vector<int>>... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class DisjointSet {\n \npublic:\n vector<int> rank, parent, size;\n DisjointSet(int n) {\n rank.resize(n + 1, 0);\n parent.resize(n + 1);\n size.resize(n + 1);\n for (int i = 0; i <= n; i++) {\n parent[i] = i;\n size[i] = 1;\n }\n }\n\n in... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "const int N=1e5+10;\nint par[N];\nint siz[N];\nvoid make(int i)\n{\n par[i]=i;\n siz[i]=1;\n}\nint find(int i)\n{\n if(i==par[i])return i;\n return par[i]=find(par[i]);\n}\nvoid uni(int a,int b)\n{\n a=find(a);\n b=find(b);\n if(a!=b)\n {\n if(siz[a]<siz[b])swap(a,b);\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class DisjointSet{\nprivate:\n vector<int> parent,size;\n int componentCount;\npublic:\n DisjointSet(int n){\n parent.resize(n);\n for(int i=0;i<n;i++){\n parent[i]=i;\n }\n size.resize(n,1);\n componentCount=n;\n }\n int find(int u) {\n i... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Disjoint_set\n{\n\npublic:\n vector<int> rank, parent;\n Disjoint_set(int n)\n {\n rank.resize(n+1 , 0);\n parent.resize(n+1 );\n for (int i = 0; i <=n; i++)\n {\n parent[i] = i;\n }\n }\n int find_uparent(int node)\n {\n if (pare... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n\n void dfs(int node, vector<int>&vis, vector<int>adj[])\n {\n vis[node] = 1;\n\n for(auto it: adj[node])\n {\n if(vis[it] != 1 )\n {\n dfs(it,vis,adj);\n }\n }\n }\n\n int makeConnected(int n... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n void DFS(vector<vector<int>>& adj_matrix, vector<int>& visited, int u)\n {\n visited[u]=true;\n for(int neighbour=0;neighbour<adj_matrix[u].size();neighbour++)\n {\n if(!visited[adj_matrix[u][neighbour]])\n {\n DFS(... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n void dfs(int node,vector<vector<int>> &adj, vector<int> &vis){\n vis[node] = 1;\n for(auto it: adj[node]){\n if(vis[it] == 0) dfs(it,adj,vis);\n }\n }\n\n int makeConnected(int n, vector<vector<int>>& connections) {\n if(connect... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n\n void dfs(int i,vector<int> &visited ,vector<vector<int>>&G){\n visited[i] =1;\n for(auto c :G[i] ){\n if(!visited[c])\n dfs(c,visited,G);\n }\n }\n int makeConnected(int n, vector<vector<int>>& connections) {\n if(... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n \n \n void dfs(int i, vector<int> &vis, vector<vector<int>> &adj){\n vis[i]=1;\n for(auto it: adj[i]){\n if(!vis[it]){\n dfs(it, vis, adj);\n }\n }\n \n }\n int makeConnected(int n, vector<vector<int... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n \n void dfs(int i,vector<vector<int>> &adj,vector<int> &vis,int par){\n vis[i]=1;\n \n for(auto x:adj[i]){\n if(vis[x]==0 && x!=par) {\n dfs(x,adj,vis,i);\n }\n }\n }\n \n \n int makeConnected(int... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n void dfs(int u, int parent, vector<vector<int>>& adj, vector<int>& visited, int& node, int& edge) {\n visited[u] = 1;\n node++;\n for (auto v : adj[u]) {\n if (!visited[v]) {\n dfs(v, u, adj, visited, node, edge);\n }\... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n\n void dfs(const vector<int> adj[],vector<bool>& vis,int s){\n for(int el:adj[s]){\n if(!(vis[el])){\n vis[el]=true;\n dfs(adj,vis,el);\n }\n }\n }\n\n int makeConnected(int n, vector<vector<int>>& conn) ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\nvector<int>parent;\nvector<int>rank;\n int find(int x){\n if(x==parent[x]){\n return x;\n }\n return parent[x]=find(parent[x]);\n }\n\n void Union(int x,int y){\n int px=find(x);\n int py=find(y);\n if(px==py){\n return ;\n }else{\n if(... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "struct Node {\n int n = 0;\n bool visited = false;\n std::vector<Node*> children;\n};\n\nstd::pair<int, int> dfs(Node& node) {\n if (node.visited) {\n return {0, 0};\n }\n\n node.visited = true;\n auto res = std::make_pair(1, node.children.size());\n for (auto child: node.chi... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "struct Node {\n int n = 0;\n bool visited = false;\n std::vector<Node*> children;\n};\n\nstd::pair<int, int> dfs(Node& node) {\n if (node.visited) {\n return {0, 0};\n }\n\n node.visited = true;\n auto res = std::make_pair(1, node.children.size());\n for (auto child: node.chi... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n int makeConnected(int n, vector<vector<int>>& connections) {\n if (connections.size() < n-1) return -1;\n vector<vector<int>> g(n);\n for (const auto& c : connections) {\n g[c[0]].push_back(c[1]);\n g[c[1]].push_back(c[0]);\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "\nclass DisjointSet {\npublic:\n vector<int> rank, parent, size;\n DisjointSet(int n) {\n rank.resize(n + 1, 0);\n parent.resize(n + 1);\n size.resize(n + 1);\n for (int i = 0; i <= n; i++) {\n parent[i] = i;\n size[i] = 1;\n }\n }\n\n in... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\n vector<bool> vis;\n vector<vector<int>> adj;\n void dfs(int node,int parent){\n vis[node]=true;\n // int ans=1;\n for(auto it: adj[node]){\n if(it==parent) continue;\n if(!vis[it]){\n dfs(it,node);\n }\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n int find_parent(int u,vector<int>&parent){\n if(parent[u] == u){\n return u;\n }\n return parent[u] = find_parent(parent[u],parent);\n }\n bool do_stuff(int u,int v,vector<int>&parent,vector<int>&sizes){\n int p_u = find_parent(u,p... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n int find_parent(int u,vector<int>&parent){\n if(parent[u] == u){\n return u;\n }\n return parent[u] = find_parent(parent[u],parent);\n }\n bool do_stuff(int u,int v,vector<int>&parent,vector<int>&sizes){\n int p_u = find_parent(u,p... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n int find_parent(int u,vector<int>&parent){\n if(parent[u] == u){\n return u;\n }\n return parent[u] = find_parent(parent[u],parent);\n }\n bool do_stuff(int u,int v,vector<int>&parent,vector<int>&sizes){\n int p_u = find_parent(u,p... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n void dfs(int node, vector<vector<int>>& adj, vector<bool>& visit) {\n visit[node] = true;\n for (int neighbor : adj[node]) {\n if (!visit[neighbor]) {\n dfs(neighbor, adj, visit);\n }\n }\n }\n\n int makeConnecte... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\nprivate:\n void dfs(int i, vector<vector<int>>& adj, vector<bool>& visited) {\n visited[i] = true;\n\n for (int n : adj[i]) {\n if (!visited[n]) {\n dfs(n, adj, visited);\n }\n }\n }\n\npublic:\n int makeConnected(int n, v... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\nvoid dfs(int node,vector<vector<int>> &adj,vector<bool> &vis){\n vis[node]=true;\n\n for(auto ch: adj[node]){\n if(!vis[ch]){\n dfs(ch,adj,vis);\n }\n }\n}\n int makeConnected(int n, vector<vector<int>>& connections) {\n vector<int> deg... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\nint res=0;\n\n void dfs(int node,int parent,vector<bool>&vis,vector<vector<int>>&adj) {\n vis[node] = true;\n\n for (auto it : adj[node]) {\n if (it==parent)continue;\n if (!vis[it]) {\n dfs(it,node,vis,adj);\n } el... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\nvoid dfs(vector<int>adj[],vector<int>& visited, int src)\n{\n visited[src]=1;\n for(int i:adj[src])\n {\n if(visited[i]!=1)\n {\n dfs(adj,visited,i);\n }\n }\n}\n int makeConnected(int n, vector<vector<int>>& connections) {\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n void dfs(int node,vector<int>&vis,vector<int>adj[])\n {\n vis[node]=1;\n\n for(auto it:adj[node])\n {\n if(vis[it]==0)\n dfs(it,vis,adj);\n }\n }\n int makeConnected(int n, vector<vector<int>>& connections) {\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n void dfs(int node,vector<int> & vis,vector<int> adj[]){\n vis[node] = 1;\n for(auto it:adj[node]){\n if(!vis[it]){\n dfs(it,vis,adj);\n }\n }\n }\n int makeConnected(int n, vector<vector<int>>& connections) {\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n class Disjoint{\n public:\n vector<int> rank,size,parent;\n Disjoint(int n)\n {\n rank.resize(n,0);\n size.resize(n,1);\n parent.resize(n);\n for(int i=0;i<n;i++)\n parent[i]=i;\n }\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n struct Node {\n int key;\n Node* parent;\n };\n typedef map<int, Node*> Dict;\n\n Node* FindRoot(Node* node) {\n if (node != nullptr) {\n while (node->parent != nullptr) {\n // cout << \"================= got grand paren... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n struct Node {\n int key;\n Node* parent;\n };\n typedef map<int, Node*> Dict;\n\n Node* FindRoot(Node* node) {\n if (node != nullptr) {\n while (node->parent != nullptr) {\n node = node->parent;\n }\n }... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n int makeConnected(int n, vector<vector<int>>& connections) {\n vector<vector<int>> adj(n);\n int edges=connections.size();\n for(auto i: connections){\n adj[i[0]].push_back(i[1]);\n adj[i[1]].push_back(i[0]);\n }\n queu... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n int makeConnected(int n, vector<vector<int>>& connections) {\n vector<vector<int>> adj(n);\n int edges=connections.size();\n for(auto i: connections){\n adj[i[0]].push_back(i[1]);\n adj[i[1]].push_back(i[0]);\n }\n queu... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n vector<int>vis;\n void dfs(int x,vector<vector<int>> &adj){\n vis[x]=1;\n for(auto val:adj[x]){\n if(vis[val]==0)\n dfs(val,adj);\n }\n }\n int makeConnected(int n, vector<vector<int>>& connections) {\n if(connect... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\nprivate:\n void dfs(vector<vector<int>>&adj,vector<int>&visited,int node)\n {\n visited[node] = 1;\n for(auto neigh : adj[node])\n {\n if(!visited[neigh])\n {\n dfs(adj,visited,neigh);\n }\n }\n }\npublic... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n\n void dfs(int node,vector<int>adj[],vector<bool>&vis)\n {\n vis[node] = true;\n for(auto it : adj[node])\n {\n if(!vis[it]) {\n dfs(it,adj,vis);\n }\n }\n }\n int makeConnected(int n, vector<vector<int>>& connections) {\n vector... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "void dfs(int n,vector<bool>& vis,vector<int> g[]){\n if(vis[n])return;\n\n vis[n]=1;\n\n for(auto ch : g[n]){\n if(vis[ch])continue;\n else dfs(ch,vis,g);\n }\n}\n\nclass Solution {\npublic:\n int makeConnected(int n, vector<vector<int>>& connections) {\n if(connections.... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "// **ank**//\n#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long int\n#define all(v) v.begin(), v.end()\n#define maxi(v) *max_element(v.begin(), v.end())\n#define vecsum(v) accumulate(v.begin(), v.end(), 0LL)\n#define mini(v)... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n int n;\n vector<int> vis;\n vector<vector<int>> g;\n void dfs(int ind, int comp){\n vis[ind] = comp;\n for(auto v : g[ind]){\n if(!vis[v]){\n dfs(v, comp);\n }\n }\n }\n\n\n int makeConnected(int n, vect... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n int makeConnected(int n, vector<vector<int>>& connections) {\n\n vector<vector<int>> adjList(n);\n\n for(auto a:connections)\n {\n adjList[a[0]].push_back(a[1]);\n adjList[a[1]].push_back(a[0]);\n } \n\n vector<vec... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n\n void dfs(int i, vector<bool>& visited, vector<vector<int>>& g){\n visited[i] = 1;\n for(auto v: g[i]){\n if(!visited[v]) dfs(v, visited, g);\n }\n }\n int makeConnected(int n, vector<vector<int>>& connections) {\n if (connections... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\nprivate:\nvoid dfs(int n,vector<vector<int>>& connections,vector<bool>&vis)\n{\n vis[n]=true;\n for(auto it: connections[n])\n {\n if(vis[it]==false)\n {\n dfs(it,connections,vis);\n \n }\n }\n}\npublic:\n int makeConnected(int n, v... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n private:\n void dfs(vector<vector<int>> &adj, vector<bool> &visited, int src)\n {\n visited[src] = true;\n for(int i : adj[src])\n if(!visited[i])\n dfs(adj, visited, i);\n }\npublic:\n int makeConnected(int n, vector<vector... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n private:\n void dfs(vector<vector<int>> &adj, vector<bool> &visited, int src)\n {\n visited[src] = true;\n for(int i : adj[src])\n if(!visited[i])\n dfs(adj, visited, i);\n }\npublic:\n int makeConnected(int n, vector<vector... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n\n void traverseConnections(vector<bool>& visited, vector<vector<int>>& connections, unordered_map<int, vector<int>>& adjacentList, int start){\n visited[start]=true;\n if(adjacentList.find(start)!=adjacentList.end()){\n for(int i=0;i<adjacentList[start].s... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n void dfs(int i, vector<bool>& vis, vector<vector<int>>& adj) {\n if(vis[i]) return;\n vis[i] = 1;\n for(auto e:adj[i]){\n if(!vis[e])\n dfs(e, vis, adj);\n }\n }\n int makeConnected(int n, vector<vector<int>>& connec... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class DisjointSet{\n vector<int>rank, parent, size;\npublic:\n DisjointSet(int n){\n rank.resize(n+1, 0);\n size.resize(n+1, 1);\n parent.resize(n+1);\n for(int i = 0; i <= n; i++)parent[i] = i;\n }\n int findUPar(int node){\n if(parent[node] == node)return no... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class DisjointSet{\n vector<int> parents;\n vector<int> size;\n public:\n DisjointSet(int n){\n size.resize(n,1);\n parents.resize(n,0);\n for(int i=0;i<n;i++){\n parents[i] = i;\n }\n }\n int getParent(int u){\n if(u==parents[u]) return u;\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n void dfs(int node, vector<int> adj[], vector<int>& vis, int color) {\n vis[node] = color;\n for (auto& ele : adj[node]) {\n if (vis[ele] == 0) {\n dfs(ele, adj, vis, color);\n }\n }\n }\n\n int makeConnected(int ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n\n class disjointSet {\n vector<int> rank;\n vector<int> parent;\n public:\n\n disjointSet(int n) {\n rank = vector<int> (n, 0);\n parent = vector<int> (n, 1);\n\n for(int i=0;i<n;i++)\n parent[i] = i;... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "#include <vector>\n#include <unordered_map>\n\nclass Solution {\npublic:\n std::unordered_map<int, bool> visited;\n\n void dfs(int index, const std::vector<std::vector<int>>& adj) {\n visited[index] = true;\n for (int i = 0; i < adj[index].size(); i++) {\n int num = adj[index... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n int makeConnected(int n, vector<vector<int>>& connections) {\n int len = connections.size();\n vector<bool> visited(n, false);\n vector<bool> visited2(n, false);\n int countSeperated = 0;\n vector<vector<int>> out(n, vector<int>(0));\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n int makeConnected(int n, vector<vector<int>>& connections) {\n int len = connections.size();\n vector<bool> visited(n, false);\n vector<bool> visited2(n, false);\n int countSeperated = 0;\n vector<vector<int>> out(n, vector<int>(0));\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n int exg=0;\n set<pair<int,int>> st;\n void dfs(int node,vector<int> &vis,vector<int> adj[]){\n vis[node]=1;\n for(auto it:adj[node]){\n if(!vis[it])\n dfs(it,vis,adj);\n else if(st.find({node,it})!=st.end())\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n int makeConnected(int n, vector<vector<int>>& connections) {\n int len = connections.size();\n vector<bool> visited(n, false);\n vector<bool> visited2(n, false);\n int countSeperated = 0;\n vector<vector<int>> out(n, vector<int>(0));\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\nprivate:\nvoid dfs(vector<vector<int>>& g, int u, unordered_set<int>& seen) {\n for (int v: g[u])\n if (seen.insert(v).second)\n dfs(g, v, seen);\n}\npublic:\n int makeConnected(int n, vector<vector<int>>& connections) {\n int noc = 0;\n vector<vector... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n void dfs(int node,unordered_set<int> &visited,vector<vector<int>>&adj)\n {\n visited.insert(node);\n for(auto it:adj[node])\n {\n if(visited.find(it)==visited.end())\n {\n dfs(it,visited,adj);\n }\n }\... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n int makeConnected(int n, vector<vector<int> >& connections) {\n unordered_map<int, vector<int> > nodeMap;\n for(int index=0; index<connections.size(); index++) {\n if(nodeMap.count(connections[index][0])>0) {\n nodeMap[connections[index... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n \n \n void dfs(int node, vector<int>& visited,unordered_map<int,vector<int>>& m)\n {\n if(visited[node])return;\n \n visited[node]=1;\n for(auto child: m[node])\n {\n if(!visited[child])\n {\n df... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n vector<int>vis,par,size;\n vector<vector<int>> graph;\n void dfs(int node){\n vis[node]=1;\n for(int nbr : graph[node]){\n if(vis[nbr]==0)\n dfs(nbr);\n }\n }\n int findPar(int x){\n if(par[x]==x)\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n\n void traverseConnections(vector<bool>& visited, vector<vector<int>>& connections, unordered_map<int, vector<int>>& adjacentList, int start){\n visited[start]=true;\n // if(adjacentList.find(start)!=adjacentList.end()){\n for(int i=0;i<adjacentList[start... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\nprivate:\n void DFS(unordered_map<int,vector<int>>&graph,int i ,vector<bool>&visited){\n visited[i]=true;\n for(int v:graph[i]){\n if(!visited[v]) DFS(graph,v,visited);\n }\n }\npublic:\n int makeConnected(int n, vector<vector<int>>&connections) {\... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n\n void dfs(int node,unordered_map<int,vector<int>>&adj,vector<bool>&visit)\n {\n visit[node] = true;\n for(auto& neigh : adj[node])\n {\n if(!visit[neigh])\n {\n dfs(neigh,adj,visit);\n }\n }\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n void dfs(int x, vector<bool >& visited,unordered_map<int,vector<int>>&adj)\n {\n \n visited[x]=true;\n for(auto it:adj[x])\n {\n if(visited[it]==false)\n {\n dfs(it,visited,adj);\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "auto init = [](){\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n return 'c';\n}();\n\nclass Solution {\npublic:\n void dfs(unordered_map<int,vector<int>> &mp, int node, vector<bool> &visited){\n visited[node] = true;\n for(auto &i : mp[node]){\n if(!v... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n void dfs(vector<vector<int>>& graph, unordered_set<int>& visited, int i){\n int n=graph.size();\n for(int j:graph[i]){\n if(!visited.contains(j)){\n visited.insert(j);\n dfs(graph, visited, j);\n }\n }\n... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n int makeConnected(int n, vector<vector<int>>& connections) {\n vector<set<int>> adj(n);\n for (const auto& c : connections) {\n adj[c[0]].insert(c[1]);\n adj[c[1]].insert(c[0]);\n }\n\n vector<int> labels(n, -1);\n int ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n void dfs(vector<int> adj[], int index, int parent, unordered_map<int, bool>& visited, int& edges,\n set<pair<int, int>>& extra){\n for(auto x: adj[index]){\n if(visited.find(x) == visited.end()){\n visited[x] = true;\n df... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n void dfs(vector<int> adj[], int index, int parent, unordered_map<int, bool>& visited, int& edges,\n set<pair<int, int>>& extra){\n for(auto x: adj[index]){\n if(visited.find(x) == visited.end()){\n visited[x] = true;\n df... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\n\npublic:\n void dfs(unordered_map<int,vector<int>> &adj,vector<bool> &visited,int u){\n if(visited[u]==true) return;\n\n visited[u]=true;\n for(auto &v : adj[u]){\n if(visited[v]==false){\n dfs(adj,visited,v);\n }\n }\n }\n\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n void dfs(int node, vector<vector<int>>& connections, stack<int>& st, vector<bool>& vis) {\n vis[node] = true;\n for (auto &it : connections[node]) {\n if (!vis[it]) dfs(it, connections, st, vis);\n }\n st.push(node);\n }\n \n vo... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n void dfs(int node, vector<vector<int>>& adjList, stack<int>& st, vector<bool>& vis) {\n vis[node] = true;\n for (auto &it : adjList[node]) {\n if (!vis[it]) dfs(it, adjList, st, vis);\n }\n st.push(node);\n }\n \n void dfs2(int ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class UnionFind {\n public:\n unordered_map<int, int> parent, rank;\n\n void init(int n) {\n for (int i = 0; i < n; i++) {\n parent[i] = i;\n rank[i] = 0;\n }\n }\n int find(int n) {\n if (n != parent[n]) {\n parent[n] = find(parent[n]);\... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n int makeConnected(int n, vector<vector<int>>& connections) {\n if(connections.size() < n - 1)\n return -1;\n vector<vector<int>> adj(n);\n for(auto v : connections)\n {\n adj[v[0]].push_back(v[1]);\n adj[v[1]].push_... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n void dfs(unordered_set<int>&visited,vector<vector<int>>&graph,int node){\n visited.insert(node);\n for(auto neighbour:graph[node]){\n if(visited.count(neighbour)==0){\n dfs(visited,graph,neighbour);\n }\n }\n }\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n int makeConnected(int n, vector<vector<int>>& connections) {\n if (connections.size() < n - 1)\n return -1;\n\n vector<vector<int>> graph(n);\n for (auto connection : connections)\n {\n graph[connection[0]].push_back(connectio... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\nvoid dfs(int node,int n,vector<int>&vis,unordered_map<int,vector<int>>&adj){\n vis[node]=1;\n\n for(auto it:adj[node]){\n if(!vis[it]){\n dfs(it,n,vis,adj);\n }\n }\n\n}\n\n int makeConnected(int n, vector<vector<int>>& con) {\n if(con.siz... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n\n void solve(int src ,unordered_map<int,list<int>>&adj,vector<int>&vits ){\n \n\n vits[src]=true;\n\n for(auto nbr :adj[src]){\n \n if(!vits[nbr]){\n \n solve(nbr,adj,vits);\n\n }\n }\n\n\n }\n\n\n\... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n\n void solve(int src ,unordered_map<int,list<int>>&adj,vector<int>&vits ){\n \n\n vits[src]=true;\n\n for(auto nbr :adj[src]){\n \n if(!vits[nbr]){\n \n solve(nbr,adj,vits);\n\n }\n }\n\n\n }\n\n\n\... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\nvoid f(map<int,vector<int>> &adj,int node,vector<int> &v){\n //cout<<node<<endl;\n v[node]=1;\n for(auto i:adj[node]){\n if(v[i]==0){\n f(adj,i,v);\n }\n \n }\n return;\n}\n int makeConnected(int n, vector<vector<int>>& connections... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\nvector<list<int >>graph;\nvoid add(int src,int dest){\n graph[src].push_back(dest);\n graph[dest].push_back(src);\n}\nset<int >visited;\nvoid fn(int i){\n visited.insert(i);\n for(auto x:graph[i]){\n if(visited.find(x)==visited.end()){\n fn(x);\n ... |
1,442 | <p>There are <code>n</code> computers numbered from <code>0</code> to <code>n - 1</code> connected by ethernet cables <code>connections</code> forming a network where <code>connections[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> represents a connection between computers <code>a<sub>i</sub></code> and <code>b<sub>i</sub>... | 3 | {
"code": "class Solution {\npublic:\n int makeConnected(int n, vector<vector<int>>& connections) {\n unordered_map<int, vector<int>> adj;\n for(auto x: connections) {\n adj[x[0]].push_back(x[1]);\n adj[x[1]].push_back(x[0]);\n }\n\n vector<bool> vis(n, false);\n\n... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.