Given a linked list of size **N**. The task is to complete the function **countNodesinLoop() **that checks whether a given Linked List contains **loop or not **and if **loop **is present then** return the count of nodes** in loop or else **return 0.**

**Input(to be used for Expected Output Only):**

**First line **of input contains number of testcases T. For each testcase,** first line** of input contains length of linked list and** next line** contains data of the linked list, and the **third line **contains the **position **of the node from **beginning **(**0 based indexing**) to which the last node will be connected to form a loop.

**Note: If the input of the third line is zero then there is no loop.**

**Output:**

For each testcase, there will be a single line of output containing the length of loop in linked list, else print 0, if loop is not present in the linked list.

**User Task:**

The task is to complete the function **countNodesinLoop**() which contains the only argument as reference to head of** linked list**.

**Constraints:**

1 <= T <= 100

1 <= N <= 500

**Example:
Input:**

2

10

25 14 19 33 10 21 39 90 58 45

4

2

1 0

1

6

1

**Explanation:
Testcase 1: **The loop is 45->10. So length of loop is

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

murli01 | 343 |

decoder_101 | 216 |

Sulagna | 189 |

kya_bolti_public | 172 |

madhursengar24 | 172 |

PiyushPandey4 | 717 |

john_wick | 681 |

ASWATHAMA | 565 |

akhyasharma01 | 547 |

jagrit_ | 507 |

blackshadows | 5362 |

Ibrahim Nash | 5242 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4598 |

Login to report an issue on this page.