Problem 753 · Hard

Cracking the Safe

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

Open the interactive visualisation