Google Interview Question


Country: United States




Comment hidden because of low score. Click to expand.
0
of 0 vote

An Euler tour visits each edge exactly once. A hamilton path visits each vertex exactly once. Not all graphs have euler path or hamiltonian paths. But what is a two way Euler tour that can be drawn such it does nt cross itsefl at any vertex? Is this a hamiltonian path that is an euler route?

- ChrisK November 12, 2017 | Flag Reply


Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More