Interview Question

Anonymous Interview New York, NY

Write an algorithm to find a loop in a graph. The graph is

  unidirectional with any number of connections. The graph is not necessarily connected
Answer

Interview Answer

2 Answers

0

Answered using recursion

Interview Candidate on Apr 9, 2013
0

can you please share some of the questions asked in the technical phone interview

amy on Apr 10, 2013

Add Answers or Comments

To comment on this question, Sign In with Facebook or Sign Up