Making Wired Connections | Components of Graph | Love Babbar DSA Sheet | Placement | Amazon🔥
Vložit
- čas přidán 25. 07. 2024
- #graph #competitiveprogramming #coding #dsa
Hey Guys in this video I have explained with code how we can solve the problem 'Making Wired Connections'.
Join our Telegram Channel for more Information
🔰 Telegram Channel Link = t.me/CodeLibrary1
🔰 Array question Playlist = • Love Babbar DSA 450 Qu...
🔰 String question Playlist = • Love Babbar DSA 450 Qu...
🔰 Searching and Sorting question Playlist = • Love Babbar DSA 450 Qu...
🔰 Binary Tree question Playlist = • Love Babbar DSA 450 Qu...
🔰 Dynamic Programming question Playlist = • Love Babbar DSA 450 Qu...
🔰 RoadMap of Web Development = • 🔴 Web Development Road...
🔰 Roadmap for Dynamic Programming = • Complete Roadmap for D...
🔰 Great Strategy to solve DSA = • Great Strategy to solv...
🔰 My Journey to 5 star at codechef = • My Journey to 5 Star a...
🔰 Love Babbar DSA Sheet : drive.google.com/file/d/1FMdN...
Follow us on Instagram:
🔰 Shailesh Yogendra : / shaileshyogendra
🔰 Yogesh Yogendra : / i_am_yogesh_here
Follow us on LinkedIn:
🔰 Yogesh Yogendra : / yogesh-yogendra-26bbb518a
🔰 Shailesh Yogendra : / shailesh-yogendra-8b13...
Hope you like it. Comment if you have any doubt
LIKE | SHARE | SUBSCRIBE
You guys are doing an amazing job!!!
Thank you so much
You may not have million subscribers but let me tell you that You are doing an amazing job. Keep it up
sahi keh raha hai bhai🔥
Bhai tum tho bare heavy op hoooo!!
great work sir
Thanks for making this question easy!
Helpful bro❤️
Can u please tell me why are u declaraing 2d vector ...can we do It using edges which is already given in question?
because we have only given edges, we have to connect them first before dfs call, i think so.
Can u pls tell why am I getting TLE when I use vector g(n) and not when I use vector g[n]. I think it's one and the same thing🤔
lol yeah, Happened with me too.
Pass via reference when using vector g(n)
Giving tle in my case don't know why
92.15% faster
90.25% lesser memory
class Solution {
public:
int parent[100000];
int rank[100000];
void initial()
{
for(int i =0 ;i