Fundamental Graphs Knowledge - Intro + Basic Algorithms

preview_player
Показать описание

Link to this lesson on the course's website: [gone for now, sorry]
Currently, judging/debugging capabilities are not available yet, but it does have a text version of this lesson and some links to places to submit the problems.

Timestamps:
Intro 00:00
Structure 01:44
Definitions 02:25
Representation in code 12:40
Practice "set" 1 15:10
BFS 17:32
DFS 25:15
Practice set 2 29:06
Рекомендации по теме
Комментарии
Автор

I knew this guy from his fighting FANG interview videos and started to learn from his past instructional videos including DP, how to practice. how to review after contest.... I am really glad that I found this hidden gem

nelsonwang
Автор

I've been looking for some graph videos lately and now you've blessed me with one. TY!

luvmakin
Автор

New to your channel but I’ve been watching all your videos, love them!

theJasin
Автор

Thank you brother for your wonderful insights, I should recommend everyone to watch it.

debanjandas
Автор

Just two words, i have nothing else : THANK YOU.

aligohar
Автор

Thank you so much, u made graph become easy to understand! Legend 🙏

rickychow
Автор

Thanks! Another awesome video. Except for the "Adjacency Matrix" title on the "Adjacency List" slide LOL JK. Keep 'em coming

tedfitzpatrickyt
Автор

Very Helpful video Galen. Really appreciate your effort. Waiting for more such videos especially on Graphs

shivarapolu
Автор

Hi! I’m newbie and glad to find out your channel.🤩💖

pipr_
Автор

when i try to open "you can submit it here" link on your website it takes me to CF and shows "you are not allowed to view the contest"
Plz fix this problem

uddiptakalita
Автор

This was a really good video.. the insights were sooo useful

siddharthsinghchauhan
Автор

Can you please make for trees also like this one???

adityaheart
Автор

Great video. Can you please made a video about trees. it will be very helpful. thank you

abdelmajidkansoussi
Автор

at the path finding problem, A has two parents{B, C}, how we got B not C too in the final path vector?

A
Автор

Can you please cover cses graph problems please 🥺

srijitmondal
Автор

Is your site down? I can't seem to access it.

-xb
Автор

Just using a stack instead of queue in BFS code will give you a DFS.

dr_davinci
Автор

Can someone provide the gym invite link?

nishantbhatia
Автор

do some live streaming of contest bruh

ashwani-yearb.tech.electr
Автор

please try be a bit more consistent :)

ayushsingh
visit shbcf.ru