Topological Sort Pattern

Order nodes in a DAG for course-schedule style problems.

#	Title	Difficulty	Topics
269	Alien Dictionary	Hard	breadth first search
329	Longest Increasing Path in a Matrix	Hard	depth first search
444	Sequence Reconstruction	Medium	breadth first search
666	Path Sum IV	Medium	breadth first search
913	Cat and Mouse	Hard	breadth first search
1203	Sort Items by Groups Respecting Dependencies	Hard	breadth first search
1728	Cat and Mouse II	Hard	breadth first search
1857	Largest Color Value in a Directed Graph	Hard	dynamic programming
2246	Longest Path With Different Adjacent Characters	Hard	depth first search
2328	Number of Increasing Paths in a Grid	Hard	dynamic programming
2392	Build a Matrix With Conditions	Hard	graph
3435	Frequencies of Shortest Supersequences	Hard	graph
3481	Apply Substitutions	Medium	graph
3620	Network Recovery Pathways	Hard	graph
3812	Minimum Edge Toggles on a Tree	Hard	greedy
3939	Count Non Adjacent Subsets in a Rooted Tree	Hard	dynamic programming