Topological Sort

There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1.

There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1.

There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1.

You have information about n different recipes.

There is a directed graph of n nodes with each node labeled from 0 to n - 1.

There is a group of n people labeled from 0 to n - 1 where each person has a different amount of money and a different level of quietness.

A tree is an undirected graph in which any two vertices are connected by exactly one path.

There is an undirected weighted connected graph.

You are in a city that consists of n intersections numbered from 0 to n - 1 with bi-directional roads between some intersections.

You are given a positive integer k.

A game on an undirected graph is played by two players, Mouse and Cat, who alternate turns.

A game is played by a cat and a mouse named Cat and Mouse.

There exists an undirected and unrooted tree with n nodes indexed from 0 to n - 1.

You are an ant tasked with adding n new rooms numbered 0 to n-1 to your colony.

You are given an array of strings words.

There is a directed graph of n colored nodes and m edges.

You are given a directed graph of n nodes numbered from 0 to n - 1, where each node has at most one outgoing edge.

Given an m x n integers matrix, return the length of the longest increasing path in matrix.

You are given a tree (i.e.

A company is organizing a meeting and has a list of n employees, waiting to be invited.