Google Interview Report
- 0of 0 votes
AnswersWrite a program that always produces a two-way Euler tour that can be drawn such as it does not cross itself at any vertex.
- jablaboo November 12, 2017 in United States| Report Duplicate | Flag | PURGE
Google - 0of 0 votes
AnswersYou are given an arbitrary number of graphs using sets such as {a,b,c,d,a}, {a,b,a}, {e,f,g,h,e}... etc. Assume each element at position x_i in a set has a directed edge to x_{i+1}. so a-->b, b-->c etc. Write a program that selects a subset of at mot k vertices that contains at least one vertex from every directed cycle in the graph.
- jablaboo November 12, 2017 in United States| Report Duplicate | Flag | PURGE
Google
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.