LeetCode 913: Cat and Mouse
A clear explanation of Cat and Mouse using game states, reverse BFS, and topological propagation.
8 notes
A clear explanation of Cat and Mouse using game states, reverse BFS, and topological propagation.
A clear explanation of Loud and Rich using graph traversal, DFS, and memoization.
Check whether nums is the unique shortest supersequence of given subsequences using topological sorting.
A clear explanation of Minimum Height Trees using leaf trimming to find the center of a tree.
A clear explanation of the Alien Dictionary problem using graph construction and topological sorting.
A clear explanation of finding a valid course ordering using topological sorting and cycle detection.
A clear explanation of detecting cycles in a prerequisite graph using topological sorting and DFS.
Maintain a valid topological ordering of a directed acyclic graph as vertices or edges are added over time.