You are given a linked list of **N** nodes. You need to remove the loop if present.

**Note: **You may use the **detectloop **function that is already present for loop detection.

**Input Format:**

First line of input contains number of testcases T. T testcases follow. For each testcase, first line of input contains length **N** of the linked list and next line contains N data of the linked list. The third line contains the position of the node(from head) to which the last node will get connected. If it is 0 then there is no loop.

**Output:**

For each testcase, in a new line, 1 will be printed if loop is removed(**correct answer**) else **0** will be printed(**for wrong answer**).

**User Task:**

You **don't have to read the input**, or print the **output**. Just complete the function **removeTheLoop**() which has only argument as head reference of the linked list. If you complete this function in correct way and loop gets removed, the answer will be 1.

**Constraints:**

1 <= T <= 50

1 <= N <= 300

**Example:**

**Input:**

2

3

1 3 4

2

4

1 8 3 4

0

**Output:**

1

1

**Explanation:**

**Testcase 1:** In the first test case N = 3

The linked list with nodes N = 3 is given. here x=2 which means last node is connected with xth node of linked list. Therefore, there exists a loop.

**Testcase 2:** N = 4 and x = 0, which means lastNode->next = NULL, thus the Linked list does not contains any loop.

Author: Shubham Joshi 1

lakshmi_pandey | 72 |

abbatta7 | 68 |

Ashish Kumar Vaishy | 62 |

aman19 | 58 |

Kumar Gaurav Singh | 58 |

saumitra13325 | 612 |

ashujack | 551 |

lakshmi_pandey | 544 |

aman19 | 538 |

piyushmittal25 | 514 |

blackshadows | 5249 |

akhayrutdinov | 5111 |

Ibrahim Nash | 5087 |

Quandray | 4354 |

sanjay05 | 3668 |

Login to report an issue on this page.