@sagnikpradhan3594
I would love more algorithms, data structures, and ML too!
@sathishshaj7815
This video is more than worth of my three year CS degree 🔥
@aykborstelmann8623
I really appreciate this format especially the combination of 100 seconds & beyond 100 seconds
@dnk1312
Every time the outro music fades in, I can literally feel that 'i get it now' rush ! Thanks a lot and keep up the outstanding work !!
@OEThe11
In 10 Min, I came out with a better understanding of graphs then I have in the previous attempts (which was a lot). Thanks for making graphs make sense.
@davidvideauortega287
Hellllll I loved this video. THANK YOU!!! This channel is seriously awesome. One of the best coding channels in the entire internet. ❤
@kritikkaushal6305
straight up one of the best channels on yt
@Zeda_
This video is awesome! I love seeing these 100 second videos pop up in my feed, they’re always fantastic. One note though: an adjacency matrix does have very bad space complexity, but part of the reason for that is that it’s making the trade-off for time. It actually is quite time efficient to check specific connections [O(1)], so it just depends on what your program is prioritizing or needs.
@magne6049
0:26 The notation you used actually indicates it is a bi-directional graph, meaning directions in both ways. An undirected graph would have no arrowheads (since arrows indicate direction), but simply a line.
@ianmubangizi6721
Did this in 2 year, we spent an Hour on it, you just did in 10mins 👍🏾👍🏾👍🏾
@djneils100
what a great video - would love to see you implement A* or Dijkstra
@carcamp5451
This channel is a gem
@melvins126
This content is GOLD. Tyvm
@ttul007
great video! quick and efficient refresher for stuff i touched 10+ years ago when i did my bachelor's. thanks :)
@adrianlukelabasan1471
More Data Structures and Algorithms videos please!!!
@Abirofficial
It was great and very informative video. Please make more on algorithm with JS
@objectObject212
Remarkable explanation!
@iancuvlad7368
You can just add a queue.isNotEmpty logic. If you want to get the shortest path with bfs you can use the Dijkstra shortest path algorithm.
@wepranaga
dude, you're hyper productive. would love to see some day in life video of yours
@Fireship