Graphs

Anagrams in a List
AskAI

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"]].

Find a Route Between Two Nodes
AskAI

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.

Find the Shortest Path Between Any Two Words in a List
AskAI

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".

Is There a Route Between Two Nodes in a Directed Graph?
AskAI

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.

Determine if a route exists between two nodes in a directed graph
AskAI

This technical problem involves determining whether a route exists between two nodes in a directed graph. An example input and output are given.

"Finding the Shortest Path in a Maze"
AskAI

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.

Shortest Path in Undirected Graph
AskAI

The shortest path between two nodes in an undirected graph can be found by traversing the graph from one node to the other.

Route between two nodes in a directed graph
AskAI

Given a directed graph, this algorithm determines whether there is a route between two specified nodes.