Given a list of words, this code problem finds all of the anagrams in the list. For example, given the input ["cat", "tac", "act", "dog ", "god", "gdo"], the output would be [["cat", "tac", "act"], ["dog", "god", "gdo"]].
This problem asks us to find a route between two nodes in a directed graph. We can use a Breadth First Search (BFS) algorithm to solve this problem.
This problem asks us to find the shortest path between any two words in a list. For example, given the list ["cat", "bat", "rat"], the shortest path would be " cat" -> "bat" -> "rat".
This problem asks whether there exists a path between two given nodes in a directed graph. If such a path exists, the algorithm should return True; if not, it should return False.
This technical problem involves determining whether a route exists between two nodes in a directed graph. An example input and output are given.
This problem is about finding the shortest path through a maze. The input is a 2D array representing the maze, and the output is the shortest path from the top-left corner to the bottom-right corner.
The shortest path between two nodes in an undirected graph can be found by traversing the graph from one node to the other.
Given a directed graph, this algorithm determines whether there is a route between two specified nodes.