Skip to content
AlgoVisual
Back to Home

Graphs

3 practice problemsInteractive visual guide

Graphs model connections. Typical tools are DFS/BFS and visited tracking.

Key Ideas

  • Represent as adjacency list.
  • Use a set/array to track visited nodes.
  • BFS is great for shortest path in unweighted graphs.

Practice Problems

Clone Graph

LeetCodeMedium

LeetCode: https://leetcode.com/problems/clone-graph/

Start Solving

Course Schedule

LeetCodeMedium

LeetCode: https://leetcode.com/problems/course-schedule/

Start Solving

Number of Provinces

LeetCodeMedium

LeetCode: https://leetcode.com/problems/number-of-provinces/

Start Solving