I have gone through about 4 or 5 data structures and algorithm books/series throughout my programming career for interviewing. Your 4 part book series with the youtube videos, and website, are by far the best. Simple explanation with great examples. Quizes in the books and lectures to ensure understanding and learning. This book series will be my number one suggestion from now on for DS and Algorithms. Please come out with an advanced series as well! Suffix arrays, LCP, compressed tries, and more. I find learning about these topics more difficult as the books tend to be too mathematical for me to easily digest, and the video series's too sporadic. For instance, the MIT video on compressed tries (SA) explains the DC3 algorithm somewhat, but from the explanation I couldnt implement it on my own and needed to watch 4 other videos on it. As well as read the papers on its implementation.
What if there is a second localized sink vertex? eg one with only 2 levels and another sink vertex with level 10. The algorithm may end up labeling level 2 sink vertex as 10
12:25 topological sort - DFS
I have gone through about 4 or 5 data structures and algorithm books/series throughout my programming career for interviewing. Your 4 part book series with the youtube videos, and website, are by far the best. Simple explanation with great examples. Quizes in the books and lectures to ensure understanding and learning. This book series will be my number one suggestion from now on for DS and Algorithms. Please come out with an advanced series as well! Suffix arrays, LCP, compressed tries, and more. I find learning about these topics more difficult as the books tend to be too mathematical for me to easily digest, and the video series's too sporadic. For instance, the MIT video on compressed tries (SA) explains the DC3 algorithm somewhat, but from the explanation I couldnt implement it on my own and needed to watch 4 other videos on it. As well as read the papers on its implementation.
Thanks for the great course. but It seems that there is a lag of the content to the speech.
yea a little lag between the voice and the slides
Thank you for this amazing course.
What if there is a second localized sink vertex? eg one with only 2 levels and another sink vertex with level 10. The algorithm may end up labeling level 2 sink vertex as 10
who came here from leetcode
Excellent course, but I wish examples were much more complicated to better understand explained concepts/ideas