This technical problem involves finding cycles in a directed graph. One way to do this is to use a depth-first search algorithm, which can detect cycles by keeping track of which vertices have been visited. If a depth-first search algorithm reaches a vertex that has already been visited, then there is a cycle in the graph.

211

Oct 01
Given a list of words, this problem seeks to find the shortest path from one word to another such that each intermediate word is also in the list. For example, if the input list is [cat, rat, bat, mat], the shortest path from cat to mat would be cat -> bat -> mat.

190

Sep 30
The problem is to find the shortest path in a directed graph from the source vertex to the destination vertex. The graph may be disconnected, have cycles, or have negative edge weights.

235

Sep 30
Given a list of integers, this program outputs the integers in reverse order.

238

Sep 30
Given a list of words, this program outputs the shortest word in the list. If there are multiple shortest words, it outputs the first one in alphabetical order.

208

Sep 30
Given a graph, find the shortest path between two nodes.

206

Sep 30