This will be one of the most viewed channels in the future. As no one has explained so well like you. I took extra 1 day to explore why topological sort is used, when I watched other youtuber's video. Keep it up ! You value true understanding instead of mugging up steps/procedures. World needs people like you ! who understand the true meaning of learning and deep understanding. Your channel will blow up one day so keep going !!!.
starting to end.....in every manner.... array or graph....in every chapter... U R THE BEST...no doubt in this... best channel here on you tube....i feel so happy for myself that...u r here for students like me ❣
Probably the most detailed explanation of shortest path in Directed Acyclic Graph on TH-cam. Every other creator has just copied the bookish algo without any intuition. I'm following your series from today onwards ❤👌
This channel is the most underrated, i've watched videos of every bhaiya didi out there and came across this and my concepts of DSA are not clearer than ever!
bhaiya dfs se topo lagate samae pura alag se nikalna hoga kyu ki wo sara calls ke baad last jiska call nahi bacha usko stack me push karta hai eek tarah se last topo element se first ki taraf but kahn algo to start se topo sort create karta hai so kahn lagate hue distance nikalne me koi dikkat nahi honi chahiye but code kuch node ke liye sol de raha kuch ke liye uppdate he nahi kar raha kuch; vector shortestPath(int N,int M, vector& edges){ // code here vectordist(N,INT_MAX); vectorind(N,0); queueq; vectoradj[N]; for(int i=0;i
Maine striver se padha tha graph usme samajh mein aaya tha lekin utna acha se nahi mere bahut sare doubt the ab aapse padh raha hu toh maja aa raha hai ❤😊
hi bhaiya when i tried to solve this problem using kahns algorithm i was not getting correct output will you please take a look vector shortestPath(int n,int m, vector& edges){ // code here vectorindegree(n,0); //create adj list vectoradj[n];//[ [ { } ] , ] for(int i=0;i1 int v=edges[i][1];// u--->v int wt=edges[i][2]; adj[u].push_back({v,wt}); indegree[v]++; } //kahns algo. queueq; for(int i=0;i
i solve this problem with 2 methods before you start 1 mid (outdegree) till you go for tropical sort then i did with it and not know how many methods i will get in your lecture 😅 really fun with coding 😄
Bhaiya aapka video 1.5x me dekhta hu tab lagta hai ki normal speed chal rha warna aise neend aane lagta hai 🥱. Mast maza aa rha afterall course completion Tak tike hue haii Thora appreciation to banta hai ha Thora backlog ho gya hai exam ki wajah se par cope up ho jayega
Bhaiya ham BFS lagake bhi is question ko nahi kar sakte if ham sabhi edge ko multiple time visit karle? Matlab Jo minimum distance hoga usko hi store karenge.
This will be one of the most viewed channels in the future.
As no one has explained so well like you. I took extra 1 day to explore why topological sort is used, when I watched other youtuber's video.
Keep it up ! You value true understanding instead of mugging up steps/procedures.
World needs people like you ! who understand the true meaning of learning and deep understanding.
Your channel will blow up one day so keep going !!!.
0:00 - Problem Statement
6:10 - BFS method
11:21 - DFS method
24:00 - Baap Logic
38:15 - Relaxation method introduction(with explanation)
47:47 - Code part
1:02:36 - HW
starting to end.....in every manner....
array or graph....in every chapter...
U R THE BEST...no doubt in this...
best channel here on you tube....i feel so happy for myself that...u r here for students like me
❣
by BFS Shortest Path in Directed Acyclic Graph :
class Solution {
public:
vector shortestPath(int n,int m, vector& edges){
vectorvec[n];
for(int i=0;i
Probably the most detailed explanation of shortest path in Directed Acyclic Graph on TH-cam. Every other creator has just copied the bookish algo without any intuition.
I'm following your series from today onwards ❤👌
"This video explains complex concepts in an easy-to-understand manner, providing deep knowledge gain."
❤❤❤❤
Jai shree Ram ❤️
Bohot bohot acha content hai
Dhanyawad dronacharya ji ❤
Gurudev aapko naman h dil se❤
Bhaiya your teaching approach is very intuitive and understandable
This channel is the most underrated, i've watched videos of every bhaiya didi out there and came across this and my concepts of DSA are not clearer than ever!
Man that was the best explanation.God level
You cannot find the better explanation then this.
The Bestest DSA Series ❤
Bhai ye content nhi milega kahi yaha se padhna shuru kar do agar pehli baar visit Kiya hai to 9 mahine se yahi se padh rha hu
bhaiya dfs se topo lagate samae pura alag se nikalna hoga kyu ki wo sara calls ke baad last jiska call nahi bacha usko stack me push karta hai eek tarah se last topo element se first ki taraf but kahn algo to start se topo sort create karta hai so kahn lagate hue distance nikalne me koi dikkat nahi honi chahiye but code kuch node ke liye sol de raha kuch ke liye uppdate he nahi kar raha kuch;
vector shortestPath(int N,int M, vector& edges){
// code here
vectordist(N,INT_MAX);
vectorind(N,0);
queueq;
vectoradj[N];
for(int i=0;i
Best DSA series 🙌
Maine striver se padha tha graph usme samajh mein aaya tha lekin utna acha se nahi mere bahut sare doubt the ab aapse padh raha hu toh maja aa raha hai ❤😊
bhaiya aaj kya hi explain kiya sab ek dum chamak gya
Day 11 /60
Attandance done
hi bhaiya when i tried to solve this problem using kahns algorithm i was not getting correct output will you please take a look
vector shortestPath(int n,int m, vector& edges){
// code here
vectorindegree(n,0);
//create adj list
vectoradj[n];//[ [ { } ] , ]
for(int i=0;i1
int v=edges[i][1];// u--->v
int wt=edges[i][2];
adj[u].push_back({v,wt});
indegree[v]++;
}
//kahns algo.
queueq;
for(int i=0;i
i solve this problem with 2 methods before you start 1 mid (outdegree) till you go for tropical sort then i did with it and not know how many methods i will get in your lecture 😅 really fun with coding 😄
Gazab explanation mza aagya❤
Nextlevel Explanation...
chmk gya bhaiyyaa 🥰 . Thank u very much
Bhaiya aapka video 1.5x me dekhta hu tab lagta hai ki normal speed chal rha warna aise neend aane lagta hai 🥱. Mast maza aa rha afterall course completion Tak tike hue haii Thora appreciation to banta hai ha Thora backlog ho gya hai exam ki wajah se par cope up ho jayega
Same😂
Mja aa gya bhaiya aaj k lecture m
chamka sir bhut ache se chamka bhaiya
Learning ++ Keep uploading bhaiya
Jai hind bhaiya
Exam ki wajah se thodi backlogs ho gyi thi but ab se daily attendance present milegi 🥰
Nice lecture ❤❤
Mza aaya!
mja aa gya
bhaiya mind blowing explanation👌
Superb bhaiya ❤
Boss of DSA ❤️❤️
CHAMAK GAYA BHAIYA BILKUL BADHIYA SE
Very well explained
Chamak Gaya ❤❤❤
great explanation
The best ❤
U r the best❤
Best explanation 😀❤
even after taking 1 year of drop , i only got 519 gate score , what shold do in life all hopes are over ,
I am so happy that i chose you over love babbar it was my best decision
Day - 11/60 #60DaysOfCode
Thanks bhiya
day 11/60 :)
Bhaiya youtube pe kai sare web dev ke course hai lakin mere ko aap se hi sikhna hai tu jaldi se web dev start karo 🙏
Thankyou Bahiya ❤❤
Ram Ram bahi❤
Aap Bhaut deep mai padate ho es vajese muje yeh channel pasnd hai
Jai Shree Ram🚩🙏🙏🙏🙏
class Pair {
int v;int wt;
Pair(int v,int wt){
this.v=v;
this.wt=wt;
}
}
class Solution {
private void dfs(int node,int[]vis,ArrayListadj,Stacks){
vis[node]=1;
for(Pair it:adj.get(node)){
if(vis[it.v]!=1){
dfs(it.v,vis,adj,s);
}
s.push(node);
}
public int[]shortestPath(int N,int M,int[][]edges){
int[]vis=new int[N];
ArrayListadj=new ArrayList();
for(int i=0;i
Hare Krishna
Bhaiya public kam ho gayi hai but ham nahi rukne Wale 😅😉
18:45 bhaiya hamare sir ne ese hi pura dsa khatam kar diya
great
best
Aag laga di
Bhaiya ham BFS lagake bhi is question ko nahi kar sakte if ham sabhi edge ko multiple time visit karle?
Matlab Jo minimum distance hoga usko hi store karenge.
Thanks Bhaiya...❤😊
Day 11/60✅
do like your videos before watching bhaiya
❤❤❤❤
GOOD MORNING BHAIYA G ❤❤❤❤❤❤❤
Good morning bhaiaa ji. 💖💖
ye content aur kahi nahi milega dost
chamak gya bhaiya
Day 207 ✅🔥
Day 11 ✅🔥
Bhaiya Radhe Radhe 🙏
Day 11❤
Bhaiya ek pyara comment chhod diya❤❤
Apko kese pta bhaia hme koi bhav nhi deta na ghr wale na bhar wale😂
Day 11 #60daysofcode
❤❤❤❤❤❤❤❤❤
intuition++
chamak gaya
Day 11
Bhaiya set kya hota hai
Sir how many topics and subtopics on DSA are left?
Good morning boss
Day 11/60 ✨🌝
Good morning Bhaiya hashing karwaoge app ?
The same code in my result showing TLE , 1014/1121 test case passed😢
Done❤❤
Done
op sir
cs++
Ek pyara sa comment ❤😊
Sir views or likes or pese k liye channel me vedio dalna bnd mt krnaa.....
aap hecker ho bhaiya
Chita hi kede🐆
graph++;
🤍
chamka ++
best