Cracking the Safe
Walk an Eulerian cycle of the de Bruijn graph with Hierholzer DFS to build a shortest string containing every password.
Walk an Eulerian cycle of the de Bruijn graph with Hierholzer DFS to build a shortest string containing every password.