Graph Algorithms for Technical Interviews - Full Course

Master graph algorithms for technical interviews in this comprehensive video course. Dive into essential topics including graph basics, depth-first and breadth-first traversals, and various problem-solving techniques. Learn to implement solutions for challenges such as finding paths, counting connected components, identifying the largest component, calculating shortest paths, and solving island-related problems. Gain practical experience by working through coding exercises from Structy, enhancing your problem-solving skills and preparing you for technical interviews in the field of computer science and software engineering.

Syllabus

) course introduction.
) graph basics.
) depth first and breadth first traversal.
) has path - https://structy.net/problems/has-path.
) undirected path - https://structy.net/problems/undirected-path.
) connected components count - https://structy.net/problems/connected-components-count.
) largest component - https://structy.net/problems/largest-component.
) shortest path - https://structy.net/problems/shortest-path.
) island count - https://structy.net/problems/island-count.
) minimum island - https://structy.net/problems/minimum-island.
) outro.