Back to course home

0% completed

# Solution: Start of LinkedList Cycle

## Problem Statement

Given the head of a **Singly LinkedList** that contains a cycle, write a function to find the **starting node of the cycle**.

## Solution

If we know the length of the **LinkedList** cycle, we can find the start of the cycle through the following steps:

- Take two pointers. Let’s call them
`pointer1`

and`pointer2`

. - Initialize both pointers to point to the start of the LinkedList.
- We can find the length of the LinkedList cycle using the approach discussed in LinkedList Cycle. Let’s assume that the length of the cycle is ‘K’ nodes.
- Move ``pointer2`

.....

.....

.....

Like the course? Get enrolled and start learning!