Skip to content
Programming101
Programmingoneonone

Learn everything about programming

  • Home
  • CS Subjects
    • IoT – Internet of Things
    • Digital Communication
    • Human Values
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
  • HackerRank Solutions
    • HackerRank Algorithms Solutions
    • HackerRank C problems solutions
    • HackerRank C++ problems solutions
    • HackerRank Java problems solutions
    • HackerRank Python problems solutions
Programming101
Programmingoneonone

Learn everything about programming

Leetcode Linked List Cycle problem solution

YASH PAL, 31 July 2024

In this Leetcode Linked List Cycle problem solution we have Given head, the head of a linked list, determine if the linked list has a cycle in it. There is a cycle in a linked list if some node in the list can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that the tail’s next pointer is connected to. Note that pos is not passed as a parameter. Return true if there is a cycle in the linked list. Otherwise, return false.

Leetcode Linked List Cycle problem solution

Topics we are covering

Toggle
  • Problem solution in Python.
  • Problem solution in Java.
  • Problem solution in C++.
  • Problem solution in C.

Problem solution in Python.

class Solution:
    def hasCycle(self, head: ListNode) -> bool:
        if head is None:
            return False
        start=head
        end=head.next
        while start is not None and end is not None and end.next is not None:
            if start==end:
                return True
            start=start.next
            end=end.next.next
        return False

Problem solution in Java.

public class Solution {
    public boolean Cycle(ListNode root) {
        if(root == null || root.next == null){
            return false;
        }
        
        ListNode slow = root;
        ListNode fast = root;
        
        while(fast != null && fast.next != null){
            fast = fast.next.next;
            slow = slow.next;
            if( slow == fast){
                return true;
            }
        }
        
        return false;

Problem solution in C++.

class Solution
{
public:
	bool hasCycle(ListNode* head)
	{
		if(NULL == head) return false;
		ListNode* p = head;
		ListNode* q = head;
		while(true)
		{
			p = p->next;
			q = q->next;
			if(NULL != q) q = q->next;
			if(NULL == q || NULL == p) return false;
			else if(p == q) return true;
		}
	}
};

Problem solution in C.

struct ListNode *inverse(struct ListNode *head) {
    struct ListNode *prev = NULL, *cur = head, *next = head; 
    while (next!=NULL) {
        cur = next;
        next = cur->next;
        cur->next = prev;
        prev = cur;
        if (next==head) {
            next->next = cur;
            return next;
        }
    }
    return cur;
}
 
bool hasCycle(struct ListNode *head) {
    if (head==NULL || head->next==NULL) {
        return 0;
    }
    struct ListNode *tail = inverse(head);
    int r = (head==tail);
    inverse(tail);
    return r; 
}

coding problems solutions

Post navigation

Previous post
Next post
  • Automating Image Format Conversion with Python: A Complete Guide
  • HackerRank Separate the Numbers solution
  • How AI Is Revolutionizing Personalized Learning in Schools
  • GTA 5 is the Game of the Year for 2024 and 2025
  • Hackerrank Day 5 loops 30 days of code solution
How to download udemy paid courses for free

Pages

  • About US
  • Contact US
  • Privacy Policy

Programing Practice

  • C Programs
  • java Programs

HackerRank Solutions

  • C
  • C++
  • Java
  • Python
  • Algorithm

Other

  • Leetcode Solutions
  • Interview Preparation

Programming Tutorials

  • DSA
  • C

CS Subjects

  • Digital Communication
  • Human Values
  • Internet Of Things
  • YouTube
  • LinkedIn
  • Facebook
  • Pinterest
  • Instagram
©2025 Programmingoneonone | WordPress Theme by SuperbThemes