What a amazing teaching you are!!! Very hardworking and caring. Very nice explanation. You do not take shortcuts while teaching and I have noticed that you really work hard to explain the things. Hardly few people does that. God bless you
sir aap ki jitni bhi video 40 , 50 , 60 minutes ki hoti hai naa ussme toh alag hi maja aata hai dekhne mai..... question ka what , how ,why sab clear 👏
I am very glad ki kisi kisi ko wo video pasand aati hain. Darr lagta hai bdi video se ki bache dekhenge nahi. Firr aisa comment ata hai to khushi hoti hai
This is one of the best, easy and extremely informative explanation about the concepts of dfs, backtracking and their patterns in general! Amazing work, Sir. Many thanks.
Thankyou sir for an excellent explanation. Never seen anyone teaching with such patience and deep analysis. Also, just because of you, I was able to solve this question even before looking at solution.
Glad to know that you liked the content and thank you for appreciating. The love and respect which I get from you people keep me highly motivated and the same I am able to forward It to you people through my videos. So, keep motivating, keep learning and keep loving Pepcoding😊
That's my Guru !! Guru Dev apko shishya ki taraf se pranam _/\_ Itii mehnat hum sabke liye kiya aapne, kya hi bolu, tareef karne k liye shabd kum pad jayenge. Thanks a lot Lot Sir! I'm part of your course, but still watch your videos for each :)
wow, this cheers me up. I am glad we at pepcoding could be of help to you. Keep learning. Also, recommend us to your juniors and peers, they may also benefit.
Sir I have learn graph from coding ninja course .......but unable to clear all concepts ....but the way you teach and your way of explaining code through dry run is awesome....I suggest your course to everyone .....
amazing teaching skill sir..keep growing...and could you make a one video related FORD FULKERSON algorithm..it is also most asking coding question from graph. It will be big thanks to you
sir, aapki video 43 min. kii heee...hmne isko 2 hrs mee complete krr paaya...and at last hmne dry run krna sikh gya...thank u so much sir...aisi content shyad hii kahi or milti...bahut bahut shukriya sir...aise hii code koo dry run krwate rhe sir...andr tkk feel hota hee🙏🙏🙏🙏🙏🙏🙏 sir pls code kii time complexity vv btaate jaiye sir
Thank you so much Beta and If you like the content could you post something on LinkedIn about us? This will help us in reaching out to more people and help a lot of other students as well Something like this Sumeet Malik from Pepcoding is making all his content freely available to the community You can check it out here - www.pepcoding.com/resources / Also, this is the youtube channel - th-cam.com/users/Pepcodingplaylists?view_as=subscriber
Glad you liked it! and If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
It is not discussed in the video, how did we make sure that the output is lexicographically smallest path first? Could you please explain about it? One approach I tried is sorting the adjacency list of each vertex. This will make sure that we get (traverse) a smaller adjacent first.
Thanks a lot. we would appreciate if you could share the channel on your FB and LinkedIn, so that maximum students can reach to the source for learning.
For those who are getting generic error in java & across the platforms , you can refer the below implementation , its for the same graph shown in the video int vertices = 7; ArrayList graph = new ArrayList(); for(int i=0;i
Glad you liked it! For best experience visit on nados.pepcoding.com Also don't forget to follow our Instagram account for all the updates. instagram.com/pepcoding/
Thankyou beta! I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem. If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
I think its time complexity will be number of permutations of visiting all vertices from src to dest which will be O((V-2)!) in worst case (fully connected graph).
Beta, I regret to inform you that, I won't be able to answer/solve the personal doubts of each and every student over here. For clearing your doubts, you can join our community on telegram - t.me/pepcoding.
Beta, I regret to inform you that, I won't be able to answer/solve the personal doubts of each and every student over here. For clearing your doubts, you can join our community on telegram - t.me/pepcoding.
base case mein print krne ki jagah ek globally defined ArrayList mein string add krlenge Fir main mein arraylist ko sort and then print that arrayList using loop
I am glad you liked it. I also hope that you are watching till end and trying to understand the what, how and especially why of the problem. If you like our efforts, we request a review g.page/Pepcoding/review?rc You can subscribe to our channel here th-cam.com/users/Pepcodingabout?view_as=subscriber
Sir, itna depth analysis & dry run aap hi kra skte ho.
Thank you so much sir.....aap jiyo hazaaro saal ❤️🙏
What a amazing teaching you are!!! Very hardworking and caring. Very nice explanation. You do not take shortcuts while teaching and I have noticed that you really work hard to explain the things. Hardly few people does that. God bless you
Thank you so much 🙂🙏
This is Top class DSA course i search On youtube. I am fan of your explanation sir..
When teachers make so much effort, students are bound to learn..!!
Thank you for such quality content..🙏❤️
tu sb videos mein comment krti h kya 🤣🤣
@@pranshulkharniwal8146 Jii
@@pranshulkharniwal8146 tu yahi notice kaene k lie baitha h kya
sir aap ki jitni bhi video 40 , 50 , 60 minutes ki hoti hai naa ussme toh alag hi maja aata hai dekhne mai.....
question ka what , how ,why sab clear 👏
I am very glad ki kisi kisi ko wo video pasand aati hain. Darr lagta hai bdi video se ki bache dekhenge nahi. Firr aisa comment ata hai to khushi hoti hai
Sir bdi video m hi mja ata h choti wali tho upar layer m hi khtm hojati h
@@Pepcoding Aisi hi in depth videos chaiye sir, 5-10 min ki videos to bhari padi hai. Aapke jitni quality nhi mili kahin aur.
Best video on this problem. Koi bhi itna depth me nhi jaata. Ab clear hua code.
Great. I hope ki mza aya.
This is one of the best, easy and extremely informative explanation about the concepts of dfs, backtracking and their patterns in general! Amazing work, Sir. Many thanks.
HATS OFF!! SIR EXPLAINS EVERYTHING WITH SO MUCH OF PATIENCE ........it really helps us to understand the problem very well.
Sir , dry run makes the concept crystal clear ! Thank you :)
Brilliant level of teaching. Darkhorse of DSA youtube. At the time of this comment, it is 83.3k subs, soon it will be 8.3M subs.
uff this is next level explanation 🔥🔥
Sir aap bhut sahi padhate ho. Best teacher ever!
Thankyou sir for an excellent explanation. Never seen anyone teaching with such patience and deep analysis. Also, just because of you, I was able to solve this question even before looking at solution.
Glad to know that you liked the content and thank you for appreciating.
The love and respect which I get from you people keep me highly motivated and the same I am able to forward It to you people through my videos.
So, keep motivating, keep learning and keep loving Pepcoding😊
@@Pepcoding Thank you so much sir and team! ❤
best explanation , no one can teach better DSA than you .
Ek he toh Dil hai.
Kitne Baar jitoege. PepCoding.
Sir....i can see your hardwork ....and it reallly motivates me to study hard....explaning the core of problem twice or thrice.....thanks a lot
it is really an awesome session .. I wish i could get this videos before... Thank you sir....
That's my Guru !! Guru Dev apko shishya ki taraf se pranam _/\_ Itii mehnat hum sabke liye kiya aapne, kya hi bolu, tareef karne k liye shabd kum pad jayenge. Thanks a lot Lot Sir! I'm part of your course, but still watch your videos for each :)
Dry run keval wahi krwa skta hai jisse concept khud acche se aata ho, thanks sir for providing such great content
bow down to the genius explanation!
God level teaching ,my attention was 100% and I was able to grasp everything
Thank you so much 🙏
Glad to hear that. Keep learning, Keep growing and keep loving Pepcoding!😊
Best explanation on the entire internet!!!!!!!
Sir you are awesome... 🙏🙏no one can beat your explanation
wow, this cheers me up. I am glad we at pepcoding could be of help to you. Keep learning. Also, recommend us to your juniors and peers, they may also benefit.
Kya teacher hai bhai❤ maza aa gya
kya analysis thi Sir, maze aa gaye :)
Thank you. Sabko bolo poora dekho.
This is just awesome..I don't have any other words for this... thank you so much
Sir I have learn graph from coding ninja course .......but unable to clear all concepts ....but the way you teach and your way of explaining code through dry run is awesome....I suggest your course to everyone .....
I know. Checkout the DP and reconfirm. Also, don't use youtube but use pepcoding portal.
@@Pepcoding yes. I use it for solving questions..
nice nice kha se ati h itni energy..thabku for being such as patient and dry run each and every line of of code..thanku man
Keep learning.
And for better experience, visit nados.io, where you will get well curated content and career opportunities.
Please talk about time complexity as well, great help
hanji, i will
amazing teaching skill sir..keep growing...and could you make a one video related FORD FULKERSON algorithm..it is also most asking coding question from graph. It will be big thanks to you
keep motivating, keep learning and keep loving Pepcoding😊
Imandar rehna bahut zaruri he --- this line was Awesome ! .. 17:50
Bilkul Beta.
I like the video even before start to watch as i know sumeet sir never fails to deliver extraordinary concept and has unique level of teaching
sir, aapki video 43 min. kii heee...hmne isko 2 hrs mee complete krr paaya...and at last hmne dry run krna sikh gya...thank u so much sir...aisi content shyad hii kahi or milti...bahut bahut shukriya sir...aise hii code koo dry run krwate rhe sir...andr tkk feel hota hee🙏🙏🙏🙏🙏🙏🙏 sir pls code kii time complexity vv btaate jaiye sir
Thank you so much Beta and If you like the content could you post something on LinkedIn about us? This will help us in reaching out to more people and help a lot of other students as well
Something like this
Sumeet Malik from Pepcoding is making all his content freely available to the community
You can check it out here - www.pepcoding.com/resources
/
Also, this is the youtube channel - th-cam.com/users/Pepcodingplaylists?view_as=subscriber
Excellent..!!Excellent..!!Excellent..!! Thanks bhai..!!
Thank you so much Sir 🙏🙏
Great Explanation !!!
next level of teaching sir ..... just OP
Really a nice explanation and deep analysis. Thank you so much Sir.
Keep learning and keep loving Pepcoding☺️
he DRY RUNS the code in DEPTH!!! thanku sumit sir
This whole series is outstanding
What an explanation, salute respect of teacher😊😊💘
Thank you
Dry run bhut..........h
Awesome! great content. Thanks sir.
Glad you liked it! and If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
Tusi great ho, teaching style is awesome
God level explaination!
best teacher. thank you sir
flood fill itna pyara padaya tha sir ne ki ye bina video dekhe ho gya
You help me a lot sir.I am very grateful to you
no one can teach like sumeet malik sir you are fab :)
It is not discussed in the video, how did we make sure that the output is lexicographically smallest path first? Could you please explain about it? One approach I tried is sorting the adjacency list of each vertex. This will make sure that we get (traverse) a smaller adjacent first.
exactly...I have the same query
sir you are best at your game is tarh in depth smjhane wala shayd hi koi ho
Thanks a lot. we would appreciate if you could share the channel on your FB and LinkedIn, so that maximum students can reach to the source for learning.
Sir aap bahot mehnat krte ho 🙏
Thank you for appreciating.
For those who are getting generic error in java & across the platforms , you can refer the below implementation , its for the same graph shown in the video
int vertices = 7;
ArrayList graph = new ArrayList();
for(int i=0;i
Sir woh flood fill wala question ka analysis dekh ke maza agaya.Thnx 4 such lovely explanations.
Aur sir graph k aur bhi videos anewala hai kya!?
Abhi to itna he hai. Total 18 questions.
www.pepcoding.com/resources/online-java-foundation/graphs
Isse aage levelup mei 82 questions aaenge.
@@Pepcoding Okk sir.Thnx again😊
Sir ji tussi greatt ho ❤️
outstanding explanation!
Glad you liked it! For best experience visit on nados.pepcoding.com
Also don't forget to follow our Instagram account for all the updates.
instagram.com/pepcoding/
Can we get stack implementation for this Tks
Indepth,god bless you sir ,thank you so much ❤️❤️
How do we ensure it’s sorted lexicographically
Superb explaination 👍
Sumeet sir old gold videos🙌🏻
sir recursion me deep jate hue agar visited kiya hai to waapis aate me to vo unvisited hi hogana phir hamme unvisited kiyo karna padh rha hai
Is there any way to decrease the time complexity using DP?
Thanks sir for doing dry run so many times
Thank you sir awesomeeee explanation.
Guys this graph playlist has only one prerequisite just complete the recursion level1 by sumeet sir
sir, time complexities bhi discuss krdia kijiye plzz!! bhut help ho jaati hai sir
2nd part of the analysis is awesome..
Thankyou beta!
I am glad you liked it. I hope that you are watching till the end and trying to understand what, how, and especially why of the problem.
If you like our efforts, will you like to write a few words about us here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )
have been waiting for this
bhai, jhelni padengi par content insightful hoga. jo last tak dekh gya, seekh ke uthega
Why dint we backtrack the ans variable here?
Sir iski time aur space complexity kitni hogi?
bahut badiya sir....
Thank You Sir For Your Guidance !!
Always welcome :) For more detailed and curated content on DSA, Web Dev etc visit nados.pepcoding.com :)
Wah maza agya aaj
I think its time complexity will be number of permutations of visiting all vertices from src to dest which will be O((V-2)!) in worst case (fully connected graph).
sir ek galati ho gayi at 10:38 jo apne path 012346 likha hai to vo nahi hoga kyuki 6 to jo humne path likha hai 0123456 usme hi visited ho chuka hai
Unvisit kia hai
Ha kr lia tha dry run...or seekh li skill..love u sir...🤭🤪
U r brilliant!
sir ji , lexicographical order kese karna hai ye reh gaya .
array ki sari arraylists sorted honi chahiye for this purpose ??
Yar wo input mei sorted di hain. Isliye assume kar lia.
@@Pepcodingsir, agar source 3 liya aur dest 1 tab output 321 and 301 aaega (for the given input) which is opposite of the lexicographical order.
@@saarthakgupta4391 you can keep on pushing Paths in a Arraylist of strings (or vector of strings in C++) and then sort it and print it.
@@komaldeepsingh6356 understood...thanks
@@saarthakgupta4391 My pleasure 😊
Messiah for every struggling coder
Thank you sir😀
Most welcome
if im using StringBuilder instead of string.. my output is coming wrong..can anyone help
StringBuilder me dala hai to recursion mei deep jate hue agar add kia hai to waapis aate hue remove kijie.
@@Pepcoding can u please share the code snippet..when im removing while coming back...its throwing an exception
what is the time complexity of this algo?
Beta, I regret to inform you that, I won't be able to answer/solve the personal doubts of each and every student over here. For clearing your doubts, you can join our community on telegram - t.me/pepcoding.
jabardast sir...
Thank you beta.
Ye series poori nahi hai na ?
Sir eska path list ke form me bhegna ho to kaise krenge eske question leetcode pe hai print nhi hai
Ek arraylist of string extra parameter bhejo. base case mei add karne ki jagah usme add karte rho. main mei aake us arraylist ko print kra lo
Sir ye pura flood fill hi hai usme her node ke pass 4 option the esme bas depend ker rha hai apne edges pe
Exactly, aap bhot acha seekh rhe hain
Isko maine pichla m hi krne di 80%
@@anjneykumarsingh4461 it means
kya paid classes mein sumeet sir DSA padhayenge?
"Aaiye isko code kre" has a separate fanbase
Ye question toh flood fill ka. Bhai nikla 😀😀😀
Is this algo is in O(V+E)??
Beta, I regret to inform you that, I won't be able to answer/solve the personal doubts of each and every student over here. For clearing your doubts, you can join our community on telegram - t.me/pepcoding.
Question me doubt h
zaruri thodi h i har chota nuber hi phle aaega, kya pta 1 se phle 3 aae tab kya hoga
base case mein print krne ki jagah ek globally defined ArrayList mein string add krlenge
Fir main mein arraylist ko sort and then print that arrayList using loop
best sir jii
Thankyou beta!
Keep learning😊
hum av 4th me hai tb hmko ye sb mila..kass phle mil gya hota...ab kya h kr sakte..
Multiple source Bfs krwa dete toh bhut help ho jaati.
aisa question foundation mei he hai. kal dal jaega.
14:06
There's no one like you
I am glad you liked it. I also hope that you are watching till end and trying to understand the what, how and especially why of the problem.
If you like our efforts, we request a review
g.page/Pepcoding/review?rc
You can subscribe to our channel here
th-cam.com/users/Pepcodingabout?view_as=subscriber
if Dry Run is an art sumeet malik is a real artist
wow❤️
east or west sumeet sir is the best
Thank you so much Beta.
Is this backtracking
floodfill hai. backtracking bhi hai (visited ko unvisit kia) aur graph to hai he.