Very good explanation.Please add more videos for DP and backtracking and also explain why we need to use DP and backtracking.Direct answers are difficult to understand for DP.
please, make a video on applications of DFS and BFS like strongly connected componenets and topological sort. These topics are also part of my course which i am taking now a days.
When 3 is pushed into stack and P point to 3 now after pushing 6 why you don't check last condition that is there is no valid adjacent vertex of P so ideally 6 have to be pop but why you skip that condition ???
a simple code for dfs in cpp: void dfs(vector adj[] , int x){ stack s; // stack initialization vector visited; // visited vector initilaization int le; // for printing the last top element in the stack for(int i=0; i
Explaining wholeheartedly... Keep the quality work up !!!
This channel's value is incalculable.
Sir you are graced in these matters. Thanks for the explanation.
Thanks dada for posting these videos, your content is very genuine and very easy to understand. Wish you all the success :)
You are very good at explaining! Thank you so much for helping me understand these concepts. You should do videos on KDtrees and BTrees too.
can you give me working code for this
Awesome Explanation...you are great sir...
Simply the best explanation
Thank you so much sir for explaining this concept ,your explanation is very clear and your channel is one of my favourite
sir your videos sre very good waiting for more videos on algorithms.
Awesome Explaination !!
your explanation is very nice sir
Thanks
great video sir
Nice explanation Sir ❤️
Very good explanation.Please add more videos for DP and backtracking and also explain why we need to use DP and backtracking.Direct answers are difficult to understand for DP.
Yes agree
please make an of circular linkedlist...it's very important .
thank you
Superb sir...
sir you are amazing
Excellent explanation sir.
Sir can u please write the code for DFS traversal in the video and explain it
please, make a video on applications of DFS and BFS like strongly connected componenets and topological sort. These topics are also part of my course which i am taking now a days.
Sure salal...thanks.
Y u looks so innocent sir
Thanks sir it's really helpful
nice bro🙂
Sir, can you give the working code for bfs and dfs
Best explain sir,😇
nice sir
can you explain m-way search tree please?
for DFS ,at 6 we found 4 and 8 as adjacent vertices ,as you said we can pick any of two if we pick 4 can this still can be a DFS
Can somebody please clarify this
Yeah . The answer would be 0 1 3 6 4 2 5 7 8 (There are other possibilities too)
i think it will be ok it will be not ok if we added both it will be bfs
@unique_gamer, you were unfortunate to get the prize.
Sir, aap padhate bhadiya ho.
👌👌👌👌👌👌👌
Sir please make a code for bfs and dfs !!!
When 3 is pushed into stack and P point to 3 now after pushing 6 why you don't check last condition that is there is no valid adjacent vertex of P so ideally 6 have to be pop but why you skip that condition ???
good
Very Nice Videos!!!
Keep up the good work
Jay Maharashtra bhava!!!
Explain dijistras algo
a simple code for dfs in cpp:
void dfs(vector adj[] , int x){
stack s; // stack initialization
vector visited; // visited vector initilaization
int le; // for printing the last top element in the stack
for(int i=0; i
We want video for prims algorithm in ds
Yeah
Kindly requesting u sir... We want code for these graphs sir...
Request A* graph in c
You are the best
Nice bro
Can you give me the working code please..
BFG Algorithm
Can you please post some videos on Heaps
vhartex, vheriable, vhartices, recorading, vhan, vhisited
Sir coding please
paros nah english abr english koite ahos halar put
Too. Much explaining is not good.