leetcode.md

TOC

• graph
• DFS
• BFS
• bipartite

graph

• 797. All Paths From Source to Target (Difficulty: 2)
• 886. Possible Bipartition (Difficulty: 3)
• 997. Find the Town Judge (Difficulty: 2)
• 1129. Shortest Path with Alternating Colors (Difficulty: 4)
• 1557. Minimum Number of Vertices to Reach All Nodes (Difficulty: 2)

DFS

• 797. All Paths From Source to Target (Difficulty: 2)

BFS

• 886. Possible Bipartition (Difficulty: 3)
• 1129. Shortest Path with Alternating Colors (Difficulty: 4)

bipartite

• 886. Possible Bipartition (Difficulty: 3)
• 1129. Shortest Path with Alternating Colors (Difficulty: 4)