Finding out if a linkedlist has a loop or not. Mergin two sorted linkedlists.

Question

AA · Accepted Answer

The last node can point to a node somewhere in the middle of the list and make a loop and not necessarily to the initial node.

JB · Answer

Question 1:

class Node
{
 public:
  Node() {next = NULL;}
  ~Node() {}
  Node* next;
};

bool hasLoop(Node* node)
{
 if(!node)
 {
  return false; // or throw
 }

 for(Node* n = node; n->next != NULL; n = n->next)
 {
  // if we hit the initial node _again_, there's a loop
  // NOTE: this uses node addresses for comparison
  if(n->next && n->next == node)
  {
   return true;
  } 
 }

 return false;
}

Amazon

Amazon Interview Question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches