Tech question1 : Linkedlist cycle. Find if there is a cycle in one linkedlist.
Anonymous
bool hasCycle(Node *head) { vector visitedNode; Node *currentPos = head; while(currentPos != NULL) { for(int i = 0; i next; } return false; }
Check out your Company Bowl for anonymous work chats.