Tagged articles

fast and slow pointers

2 articles · Page 1 of 1

Nov 13, 2023 · Fundamentals

Linked List Cycle II – Simple Reasoning to Detect a Cycle and Find Its Entry

The article explains how to detect a cycle in a singly‑linked list using fast and slow pointers, then locate the cycle’s entry node by resetting the slow pointer to the head and moving both pointers one step at a time, with full Go implementation provided.

Goalgorithmcycle detection

0 likes · 4 min read

Linked List Cycle II – Simple Reasoning to Detect a Cycle and Find Its Entry

JavaEdge

Oct 27, 2021 · Interview Experience

Detecting a Cycle in a Singly Linked List – Fast & Slow Pointer Solution for Tencent Interview

This article explains how to determine whether a singly linked list contains a cycle using three approaches—brute‑force, hash‑marking, and the optimal fast‑and‑slow pointer technique—providing Go and C++ implementations that achieve minimal time and O(1) space complexity suitable for a Tencent interview.

C++Goalgorithm

0 likes · 6 min read

Detecting a Cycle in a Singly Linked List – Fast & Slow Pointer Solution for Tencent Interview