- Algorithms for Competitive Programming - Graph
- Connected Graph
- Graph algorithms + problems to practice
Backtracking
- Word Search
- N-Queens
- N-Queens II
- Word Search II
- Palindrome Partitioning
- Letter Combinations of a Phone Number
- Permutations
- Permutations II
- Subsets
- Subsets II
- Partition to K Equal Sum Subsets
- Combinations
- Combination Sum
- Combination Sum II
- Combination Sum III
- All Paths From Source to Target
- Unique Paths III
- Minimum Genetic Mutation
DFS/BFS
- Number of Islands
- Clone Graph
- Max Area of Island
- Pacific Atlantic Water Flow
- Surrounded Regions
- Rotting Oranges
- Course Schedule
- Course Schedule II
- Redundant Connection
- Flood Fill
- Word Ladder
- Time Needed to Inform All Employees
- Restore IP Addresses
- Get Watched Videos by Your Friends
- Longest Increasing Path in a Matrix
- Maximum Total Importance of Roads
- Island Perimeter
- All Paths From Source to Target
- Surrounded Regions
- Detonate the Maximum Bombs
- Jump Game II
- Jump Game III
- As Far from Land as Possible
- Number of Enclaves
- Minimum Height Trees
Topological Sort
Connected Component (Disjoint Set)
- Remove Max Number of Edges to Keep Graph Fully Traversable
- Number of Provinces
- Number of Operations to Make Network Connected
- Accounts Merge
- Find All People With Secret
- Greatest Common Divisor Traversal
- Largest Component Size by Common Factor
- Most Stones Removed with Same Row or Column
- Redundant Connection
- Count Unreachable Pairs of Nodes in an Undirected Graph
- Check if the Rectangle Corner Is Reachable
- Shortest Distance After Road Addition Queries II
Bridges, Articulation Points
Shortest Path
- Cheapest Flights Within K Stops
- Network Delay Time
- Number of Ways to Arrive at Destination
- Path with Maximum Probability
- Second Minimum Time to Reach Destination
- [Shortest Distance After Road Addition Queries I]]
All Pair Shortest Path
- Find the City With the Smallest Number of Neighbors at a Threshold Distance
- Minimum Cost to Convert String I