Xurmo Interview Question for Interns


Country: India
Interview Type: Written Test




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

Build a graph with A,B and so on as nodes and the dependencies as edges. Then for each node, do a search (DFS or BFS) and the set of nodes you've visited are the dependencies for that class. O(N) for every class, so O(N^2) total.

- Anonymous March 23, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

thiis seems like a union find problem.

- Sumit Gera March 23, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

i would suggest use of a recursive approach with memoization, i.e. start with A, to get answer for search left hand side of all dependencies and right hand side of A , if any element on the rhs of A is in some left hand side then solve it recursively and so on.........
eg for A solve B, for B solve C but for C simply return with G as the answer since G is not on the lhs of any row

- nikaash July 05, 2013 | 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