Data Structures & Algorithms
Complete catalog of 113 interactive algorithm visualizers. Browse by data structure category or filter by difficulty.
Given a reference of a node in a connected undirected graph, return a deep copy (clone) of the graph using DFS recursion and a hash map to cache visited clones.
Determine if it is possible to finish all courses given prerequisite dependencies using Kahn's algorithm (Topological Sort BFS with in-degree tracking).
Determine if a valid path exists between a source vertex and destination vertex in a bi-directional graph using Depth-First Search (DFS) with visited state tracking.
Track incoming trust minus outgoing trust for each person, then find the person whose score equals n − 1.
Reorient the minimum number of directed roads in an n-city tree network so that every city has a path leading to capital city 0 using DFS traversal outwards from 0.