Learn and practice the Two Pointers, Fast and Slow Pointers, and Modified Binary Search patterns to solve coding interview problems.

Educative-99 in Python: Accelerate Your Coding Interview Prep

This module groups together three of the most common patterns that may be used to solve problems where the input data is linear: Two Pointers, Fast and Slow Pointers, and Modified Binary Search. Both the Two Pointers and the Modified Binary Search patterns derive their power from their ability to efficiently reduce the size of the search space, that is, both exemplify the divide-and-conquer approach to problem-solving. The Fast and Slow Pointers pattern may be considered a variant of the Two Pointers pattern, where the two pointers move at different speeds in order to traverse the input list in a way that solves the given problem. After completing this module, we will have learned how to use this set of related patterns to solve a diverse range of problems.

Two Pointers & Co.

# Statement

Given the `head` of a linked list, determine whether the list contains a cycle. A cycle exists if a node in the list can be revisited by continuously following the `next` pointers. Return TRUE if a cycle is present; otherwise, return FALSE.

**Constraints:**

Let `n` be the number of nodes in a linked list.

- $0\leq$ `n` $\leq500$
- $-10^5 \leq$ `Node.value` $\leq 10^5$




# Examples






Try to solve the Linked List Cycle problem.