[Go] LeetCode 141. Linked List Cycle


Given a linked list, determine if it has a cycle in it.

To represent a cycle in the given linked list, we use an integer pos which represents the position (0-indexed) in the linked list where tail connects to. If pos is -1, then there is no cycle in the linked list.

Example 1:

Example 2:

Example 3:

Follow up:

Can you solve it using O(1) (i.e. constant) memory?


repo: https://github.com/fukubaka0825/LeetCodeInGo/blob/master/Algorithms/0141.linked_list_cycle/linked_list_cycle.go

Site Reliablity Engineer in Tokyo. SRE/devops/Go/AWS/Terraform

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store