Best series for DS & Algo. I am also 10 yrs java exp guy. Was looking for DS & Algo free course over TH-cam with java implementation and found this. Hats Off To You Man...Excellent Work. GOD BLESS YOU :)
Please *Like* , *Comment* , *Share* , *Subscribe* and *Click Bell* 🔔🔔🔔 Icon for More Updates. To get *Data Structures and Algorithms* complete course for free please follow this link - th-cam.com/play/PL6Zs6LgrJj3tDXv8a_elC6eT_4R5gfX4d.html
Hi Dinesh.. Following your videos from long back. The way you explain the algorithms are marvelous and I know it takes lots of hard work and patience to create an animated videos. Thank you for help to let us understand the concept. One request ,please make some videos on matrix interview questions.
Sir, if here just we use Queue ds instead of stack, i guess it will give BFS. So, in the previous video, the code for BFS could be altered with this right?
hello sir, public void dfs(int s){ boolean[] visited = new boolean[ver]; Stack st = new Stack(); visited[s] = true; st.push(s); while (!st.isEmpty()){ int u = st.pop(); System.out.print(u + " "); for (int v : arr[u]){ if (!visited[v]){ visited[v] = true; st.push(v); } } } } this is the same code of BFS from your previous video , I just alternate Queue with Stack and it's work properly in DFS . so , is it can be solution??
Best series for DS & Algo. I am also 10 yrs java exp guy. Was looking for DS & Algo free course over TH-cam with java implementation and found this. Hats Off To You Man...Excellent Work. GOD BLESS YOU :)
Thanks !!!
Please *Like* , *Comment* , *Share* , *Subscribe* and *Click Bell* 🔔🔔🔔 Icon for More Updates. To get *Data Structures and Algorithms* complete course for free please follow this link - th-cam.com/play/PL6Zs6LgrJj3tDXv8a_elC6eT_4R5gfX4d.html
Hi Dinesh..
Following your videos from long back.
The way you explain the algorithms are marvelous and I know it takes lots of hard work and patience to create an animated videos.
Thank you for help to let us understand the concept.
One request ,please make some videos on matrix interview questions.
Thanks !!! Sure will add one matrix question next !!!
Best explanation of both Bfs and dfs
Sir, if here just we use Queue ds instead of stack, i guess it will give BFS.
So, in the previous video, the code for BFS could be altered with this right?
BFS deals with queue ... DFS deals with stack ...
Stil didn't get why ????
@@itsdineshvaryani so, if we use bfs implementation by Stack Except Queue then is that a solution of DFS??
What if the node has values 21,22,76,45 means not in a sequence
How would that matter?
@Dinesh Sir......... Can we have output as 0,3,2,1,4??
Sir, can you please make some videos on graph algorithms like djiktra's and prim's etc
sure will add soon !!!
sir pls add more videos on dsa
Ok will try !!!
Thanks sir
Welcome !!!
hello sir,
public void dfs(int s){
boolean[] visited = new boolean[ver];
Stack st = new Stack();
visited[s] = true;
st.push(s);
while (!st.isEmpty()){
int u = st.pop();
System.out.print(u + " ");
for (int v : arr[u]){
if (!visited[v]){
visited[v] = true;
st.push(v);
}
}
}
}
this is the same code of BFS from your previous video , I just alternate Queue with Stack and it's work properly in DFS . so , is it can be solution??
Bro is it right solution ?
@@yyashraut yes bro it’s right