Trie-of-Patterns

Problem: Construct a Trie from a Collection of Patterns

Evacuating-People

In this problem, you will apply an algorithm for finding maximum flow in a network to determine how fast people can be evacuated from the given city

scc-direct-graph

Compute the number of strongly connected components of a given directed graph with 𝑛 vertices and 𝑚 edges

connecting_points

In this problem, the goal is to build roads between some pairs of the given cities such that there is a path between any two cities and the total length of the roads is minimized.