@god_p403

I love it... Short crisp simplest explanation...

@akshaykulkarni4725

Short, concise, and to-the-point videos, are very easy to understand. Thanks for the amazing content.

@ritwickjha3954

it is guaranteed that when a node a poped we already have the best path cost for it. so why in the algorithm are we checking for "if not visited[nextNode] and nextDist < dist[nextNode]" we can simply just check "if nextDist < dist[nextNode]"

@ιŠ¨θ€ε­«

Best explanation and code walk-through ever! You are excellent in this! Thanks and please continue making more videos ^^

@aadityakiran_s

Excellent explanation. So easy to understand. Thank you so much.

@babacargadiaga4171

Amazing explanations! Thank you and keep up the great work!

@alfredoluco

Very nice explanation

@tanaykamath1415

underrated channel!

@Cloud-577

Thank you that was very helpful

@ashokk2002

Thanks for the video. 
Also, Could u plz take up this problem? 
Cheapest flight with k stops
 (I'm getting TLE with normal bfs approach )

@jlecampana

Hello Shiran, one thing I don't understand is why do you check for visited nodes when you Pull a Node from the Queue, BFS dictates that all Nodes that are added to the Queue have not been visited yet; and therefore you mark them as visited at the moment you Add them to Queue. Would you mind explaining this difference?

@MilindGupta

Hey shiran please try to make more videos also just 2-3 videos in past 4 months 😞😞

@TheAidsaids

what kind of drawing tablet + software do you use for your presentations? they are quite fantastic and want to pick somethin up for mock interviews

@yogeshdharya3857

0 : 33 Girl , ur Cities sound like CDs or compact Discs πŸ˜…πŸ€£In fact the vertices of the graph used in the image look more of blue discs or CDs to me πŸ˜‚

@whynesspower

Thats the wieredest way I have seen anyone write the "1" number