This course teaches how to implement graph algorithms and apply them to solve coding challenges. The course covers graph basics, depth-first and breadth-first traversal, as well as specific problems like finding paths, connected components, shortest paths, and counting islands. The teaching method includes video lectures and coding demonstrations. This course is intended for individuals preparing for technical interviews or looking to enhance their algorithmic problem-solving skills.
Overview
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.
Taught by
freeCodeCamp.org
Related Courses
-
Binary Tree Algorithms for Technical Interviews - Full Course
-
Algorithms Course - Graph Theory Tutorial from a Google Engineer
-
Linked Lists for Technical Interviews - Full Course
-
Graph Search, Shortest Paths, and Data Structures
1.0 -
Advanced Algorithms (Graph Algorithms) in Java
-
Graph Theory Algorithms
