Lecture 8: GFG | Remove loop in Linked List | Data structure and Algorithm in Python #DSAinPython

Data Structures & Algorithms Tutorials In Python
Remove loop in Linked List
In this video, I have described how to detect a loop in Linked List and remove the loop, implement code in Python

code solution: https://gitlab.com/-/snippets/2494747

Problems need to be solved before this problem - Please look at these problems before solving this problem

1) Detect loop in a linked list
https://youtu.be/AKSZWCg96-c
problem link - https://leetcode.com/problems/linked-list-cycle/

2) Find the first node of the loop in a linked list
https://youtu.be/P3nkYLuk2XQ
problem link - https://leetcode.com/problems/linked-list-cycle-ii/

Problem Link: https://practice.geeksforgeeks.org/problems/remove-loop-in-linked-list/1

CHAPTERS
00:00 : Detailed Explanation of how to detect a loop in Linked List
05:37 : Implement detect a loop in LinkedList in Python on Leetocde


Problem:
Given a linked list of N nodes such that it may contain a loop.

A loop here means that the last node of the link list is connected to the node at position X(1-based index). If the link list does not have any loop, X=0.

Remove the loop from the linked list, if it is present, i.e. unlink the last node which is forming the loop.

Example 1:
Input:
N = 3
value[] = {1,3,4}
X = 2
Output: 1
Explanation: The link list looks like
1 ----- 3 ----- 4
^ |
|. |
--------
A loop is present. If you remove it
successfully, the answer will be 1.

Example 2:

Input:
N = 4
value[] = {1,8,3,4}
X = 0
Output: 1
Explanation: The Linked list does not
contains any loop.