Linked Lists: Detect a Cycle
Problem Statement :
A linked list is said to contain a cycle if any node is visited more than once while traversing the list. For example, in the following graph there is a cycle formed when node 5 points back to node 3. Function Description Complete the function has_cycle in the editor below. It must return a boolean true if the graph contains a cycle, or false. has_cycle has the following parameter(s): head: a pointer to a Node object that points to the head of a linked list. Returns boolean: True if there is a cycle, False if there is not Note: If the list is empty, head will be null. Input Format There is no input for this challenge. A random linked list is generated at runtime and passed to your function. Constraints 0 <= list size <= 100
Solution :
Solution in C++ :
In C++ :
/*
A Node is defined as:
struct Node {
int data;
Node* next;
}
*/
#include <unordered_set>
std::unordered_set<Node*> visited;
bool has_cycle(Node* head)
{
// Empty lists don't have circles.
if(head == nullptr) {
visited.clear();
return false;
}
// If already in the list of visited nodes.
if(visited.count(head) != 0) {
visited.clear();
// It means we have a cycle.
return true;
}
// Otherwise, remember it.
visited.insert(head);
// Recurse for the rest of the list.
return has_cycle(head->next);
}
Solution in Java :
In Java :
/*
A Node is defined as:
class Node {
int data;
Node next;
}
*/
boolean hasCycle(Node head) {
if(head==null)
return false;
else{
Node slow=head;
Node fast=head.next;
while(fast!=null && fast.next!=null && fast!=slow){
slow=slow.next;
fast=fast.next.next;
}
if( fast!=null && fast==slow)
return true;
return false;
}
}
Solution in Python :
In Python3 :
"""
A Node is defined as:
class Node(object):
def __init__(self, data = None, next_node = None):
self.data = data
self.next = next_node
"""
def has_cycle(head):
visited = set()
it = head
while it.next:
it = it.next
if it in visited:
return True
visited.add(it)
return False
View More Similar Problems
Is This a Binary Search Tree?
For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node of a binary tree, can you determine if it's also a
View Solution →Square-Ten Tree
The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the
View Solution →Balanced Forest
Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a
View Solution →Jenny's Subtrees
Jenny loves experimenting with trees. Her favorite tree has n nodes connected by n - 1 edges, and each edge is ` unit in length. She wants to cut a subtree (i.e., a connected part of the original tree) of radius r from this tree by performing the following two steps: 1. Choose a node, x , from the tree. 2. Cut a subtree consisting of all nodes which are not further than r units from node x .
View Solution →Tree Coordinates
We consider metric space to be a pair, , where is a set and such that the following conditions hold: where is the distance between points and . Let's define the product of two metric spaces, , to be such that: , where , . So, it follows logically that is also a metric space. We then define squared metric space, , to be the product of a metric space multiplied with itself: . For
View Solution →Array Pairs
Consider an array of n integers, A = [ a1, a2, . . . . an] . Find and print the total number of (i , j) pairs such that ai * aj <= max(ai, ai+1, . . . aj) where i < j. Input Format The first line contains an integer, n , denoting the number of elements in the array. The second line consists of n space-separated integers describing the respective values of a1, a2 , . . . an .
View Solution →