What is a Hamiltonian cycle? — Given an undirected graph G = (V, E), does there exist a simple cycle Γ that contains every node in V ? Certificate is a permutation of the n nodes, contain each node in v exactly once, there is an edge btw each pair of adj nodes in the permutation.
G
1.2KGoogle Interview
This flashcard deck made by jwasham contains knowledge about google interview. For more details, please follow https://github.com/jwasham/google-interview-university