Detecting Cycles In Linked Lists With O(1) Space Complexity
Detecting cycle in linked list: O(N) time, constant space complexity. Use two pointers, one jumping two nodes at a time, to find if loop is present.
problem
//tc :O(N) N is the length of the linkedList
//sc:(1) constant space complexity
/**
* Definition for singly-linked list.
* class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public boolean hasCycle(ListNode head) {
//we can use double jump to find if loop is present in the loop
if(head ==null || head.next ==null) return false;
ListNode node1 = head;
ListNode node2 = head.next;
while(node1!=null && node2!=null){
if(...