Bhat is the problem

laksh.rustagi12 · June 9, 2021, 3:06pm

https://practice.geeksforgeeks.org/problems/remove-loop-in-linked-list/1/?category[]=Linked%20List&category[]=Linked%20List&problemStatus=unsolved&difficulty[]=1&page=1&sortBy=submissions&query=category[]Linked%20ListproblemStatusunsolveddifficulty[]1page1sortBysubmissionscategory[]Linked%20List#

my soln

mr.encoder · June 11, 2021, 6:41am

hey , send entire code as it’s not complete code.
you can take reference from this code, if you want too.

github.com

DivonilLiquid/Data-Structure-Algorithm/blob/master/Linked List/LinkedListCycleII.cpp

/**
Question:
Given a linked list, return the node where the cycle begins. If there is no cycle, return null.

There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail's next pointer is connected to. Note that pos is not passed as a parameter.

Notice that you should not modify the linked list.

Follow up:

Can you solve it using O(1) (i.e. constant) memory?

 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {

This file has been truncated. show original

mr.encoder · June 16, 2021, 5:29am

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.