All Path From Source To Target 🔥 | Leetcode Graph solution DFS Hindi explained Complete Graph Videos

[@parthlodhia5974]

Hey Prince, Awesome explanation.
I got stuck at popping back the path vector, i didn't get an idea of popping path vector.
But after your explanation, i solved it easily with DFS.
Thank you.

[@HelloWorldbyprince]

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

[@codewith_ayushluthra5248]

ajj ferse bhai tumhare video dekh ke motivation itne milte hai ke video ko ajj 27 sec dekha fer kudh solve karleya . Thanks

[@HelloWorldbyprince]

are wahh i am happy for u

[@VinayListenMe]

Great explanation, good thing is you never added unnecessary Boolean visited array as this is DAG graph so no possibility of any cycle hence Boolean array is not required.

[@Ramneet04]

I have seen all your playlist except dynamic programming, will complete it after the graph one, you're teaching way is so good,well mannered structured playlist, bless you.thx a lot bhaiyaa.

[@HelloWorldbyprince]

Thanks yaar ❤️ please share and support my channel

[@Shadowishperz]

Simplest explanantion , it would be more helpful if we discuss about time complexity towards the end of all problem videos

[@heerasingh3308]

I have solved the question in 40 minutes, without watching your video, when you say, try yourself, then I will watch your logic, thank you :)

[@HelloWorldbyprince]

Well done!

[@abhishekpaul8515]

The way you explained made it so simple! Amazing 🔥

[@HelloWorldbyprince]

please share my channel with ur friends

[@parthstark2934]

Bhaiya attempt kiya, accepted! because of you, now watching your video for further knowledge. Thanks

[@HelloWorldbyprince]

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

[@im_ykp]

Thank You for motivating me to give it a try.

[@shubhamkumar6383]

1st question i solve it by myself felt amazing !!!
class Solution {
public:
void solve(unordered_map adj , int curr , vector &res , vector tmp , int n , vector &vis ){
vis[curr] = 1;
tmp.push_back(curr);
if(n-1 == curr)
res.push_back(tmp);
for(auto k : adj[curr]){
if(!vis[k])
solve(adj,k,res,tmp,n,vis);
}
vis[curr] = 0;
}
vector allPathsSourceTarget(vector& graph) {
vector res;
unordered_map adj;
int n = graph.size();
vector vis(n,0);
for(int i=0 ; i < n ; i++){
for(auto k : graph[i])
adj[i].push_back(k);
}
vector tmp;
solve(adj,0,res,tmp,n,vis);
return res;
}
};

[@shashwatrao6949]

I solved it by myself just because of ur explanations. Thnx brother

[@HelloWorldbyprince]

waoooo buddy u r learning

[@surajhengne4633]

Is it possible to solve above problem using BFS ? The solution you showed here is not optimal too many recursive call if your graph is too large.

[@mayankchoudhary7937]

i solve it by myself thanks to you :)

[@muskangupta2545]

Thanks.. amazing explanation
Suggestion- Please add the complexity analysis also in videos

[@HelloWorldbyprince]

sure muskan
Please , if possible then share this channel in your college, groups or linkedin becoz it's cost nothing to you 😀

[@muskangupta5873]

@@HelloWorldbyprince sure I will share it

[@pritishpattnaik4674]

mast laga approach , i was able to find my mistakes

[@graphian8990]

Bhaiya graph[curr] ek vector ho then how can x can be pass to curr which is int .as curr is int and x is a vector

[@gauravkesarwani7925]

bhaiya what if there is cycle in between source and destination and then will get stuck their and never reach out destination

[@abhisheksamboddu6580]

reached milestone of 50 probs on leetcode .....with this ....started a month ago

[@HelloWorldbyprince]

Wahhh 🔥

[@rohansaraswat3740]

Thanks for the playlist, I was able to solve this Question by myself.

[@HelloWorldbyprince]

Excellent!

[@eduflex7931]

Bhaiya dfs me to visited array bhi lete ,ye recursion wala approach haina?

[@tarunkumar-kz5xi]

wo hame cycle me jane se avoid karne ke liye hoti isme DAG diya h problem statement me isliye calculate kar pa rahe h without visited array

[@rahadarafin9052]

playlist show 238 videos but we can find 200 videos.please tell me why you hide 38 videos? Those was alien types videos or google exam future questions was?

[@feminabrahmbhatt5430]

can you also explain krushkal algorithm ?

[@HelloWorldbyprince]

Sure will do

[@monkiitianiitg9349]

Thanks.. amazing explanation

[@HelloWorldbyprince]

Keep learning buddy

[@harsimran.27]

Nice explanation bhaiya 😊👍🏻👍🏻

[@HelloWorldbyprince]

Thanks a lot buddy 😀

[@PankajKumar-tg5zi]

maza agaya bhaiya

[@bokhiriyakhushalinagajanbh7019]

what will be the space complexity for this All Paths From Source to Target question?

[@atifhu]

you should have explained TC also

[@HelloWorldbyprince]

is same as DFS

[@atifhu]

@@HelloWorldbyprince no sir, it's exponential, but I didn't get it how

[@tarunkumarjoshi431]

Bhaiya what are you doing is really great i am really inspired by you the hard work you do for us .

[@HelloWorldbyprince]

Thanks bhai
Bass share kardo channel ko mere motivation ke liye

[@pranavkorhale5089]

//Java Solution
class Solution {
public List ans = new ArrayList();
public List allPathsSourceTarget(int[][] graph) {
int n = graph.length;

//[[4,3,1],[3,2,4],[],[4],[]]

int start = 0;
int end = n-1;

int arr[] = graph[start];

boolean[]visited = new boolean[n];
visited[start] = true;

List al = new ArrayList();
al.add(start);

for(int i=0;i

[@HelloWorldbyprince]

amazing bro keep it up

[@smilenpassion]

I think we don't need visited array:
class Solution {
public List allPathsSourceTarget(int[][] graph) {
List result= new ArrayList();
List path= new ArrayList();

dfs(graph, result, path, 0);
return result;
}

void dfs(int [][] graph, List result, List path, int src ){
path.add(src);
if(src==graph.length-1){
result.add(new ArrayList(path));

}

for(int nei: graph[src]){
dfs(graph, result, path,nei);
}
path.remove(path.size()-1);
}

[@anonymous090]

Great vid!😀

[@HelloWorldbyprince]

bhut badhiya dost

[@easylearning6647]

thank you bhai

[@rahulchoudhary29]

C++ solution
class Solution {
public:
void dfs(int src,int dest,vector& graph,vector currentPath,vector &res){
currentPath.push_back(src);
if(src==dest) {
res.push_back(currentPath);
return;
}
for(auto it : graph[src]){
dfs(it,dest,graph,currentPath,res);
}

}
vector allPathsSourceTarget(vector& graph) {
vector res;
vector currentPath;
int n=graph.size();
dfs(0,n-1,graph,currentPath,res);
return res;
}
};

[@HelloWorldbyprince]

Amazing keep doing hard work

[@brijeshkumarverma1223]

1:17

[@DeepakKumar-oz5ky]

maja aaya bhaiya

[@HelloWorldbyprince]

Thanks bhai

[@a036nikhilsannat4]

Why we don't have visited dict?

[@HelloWorldbyprince]

Issme jarurat nahi padda
Aap chahaho to banaa sakte the

[@jamespeterson7824]

It is directed acyclic graph..hence no need of visited..as we use visited so that it doesn't go in infinite loop.

[@akankshagupta2946]

Nice vedio

[@HelloWorldbyprince]

Thanks Akanksha
keep learning

[@vitaminprotein2217]

it must be specified in q that all are connected components :/

[@harshbhansali1327]

and this solution is possible only because it is acyclic, if there are cycles then we would need visited array

[@anuragdeol9474]

Can anyone please tell the time and space complexity of this solution?

[@HelloWorldbyprince]

is same as DFS

[@Deepakkumar-mt1ep]

can u help me
i am not able to solve the question

[@HelloWorldbyprince]

can u send me your code, or can u please try to dry run my code

[@gauravkumar6632]

can you share solution in java

[@HelloWorldbyprince]

ok i will

[@thegreekgoat98]

Idhar adjacancy list ki kyun jarurat nahi padi?

[@leetcoder1159]

whi toh given hai

[@Deepakkumar-mt1ep]

bhaiya i need help

[@HelloWorldbyprince]

yes please go ahead

[@rahulgautam6387]

Great expla....

[@HelloWorldbyprince]

keep learning bro