S10 EP 8
What you should look for in online coding courses
S10 EP 7
S10 EP 6
S10 EP 5
S10 EP 4
S10 EP 3
S10 EP 2
Join us for our topical coding conversations every Wednesday at 9PM EST.
How was coding this week? Share your goals and your wins every Sunday at 2PM EST.
Vaidehi Joshi co-host, developer, author
Saron Yitbarek co-host, developer, founder
DAG-nabbit! Don't forget to check whether or not a graph is a directed acyclic graph.
Traversing through a graph is pretty edgy.
To go about coding the depth-first search algorithm (DFS), we revisit an old friend: adjacency lists.
When going through a maze, hitting a dead end isn't always a bad thing, especially in depth-first search (DFS).