diff --git a/DIRECTORY.md b/DIRECTORY.md
index 2ede552665..457b166a22 100644
--- a/DIRECTORY.md
+++ b/DIRECTORY.md
@@ -82,6 +82,7 @@
* **Linked-List**
* [AddTwoNumbers](Data-Structures/Linked-List/AddTwoNumbers.js)
* [CycleDetection](Data-Structures/Linked-List/CycleDetection.js)
+ * [CycleDetectionII](Data-Structures/Linked-List/CycleDetectionII.js)
* [DoublyLinkedList](Data-Structures/Linked-List/DoublyLinkedList.js)
* [MergeTwoSortedLinkedLists](Data-Structures/Linked-List/MergeTwoSortedLinkedLists.js)
* [ReverseSinglyLinkedList](Data-Structures/Linked-List/ReverseSinglyLinkedList.js)
diff --git a/Data-Structures/Linked-List/CycleDetectionII.js b/Data-Structures/Linked-List/CycleDetectionII.js
new file mode 100644
index 0000000000..478586e6eb
--- /dev/null
+++ b/Data-Structures/Linked-List/CycleDetectionII.js
@@ -0,0 +1,57 @@
+/**
+ * A LinkedList based solution for finding the starting node of the cycle in a list.
+ * @returns the node where cycle begins in the linked list. If there is no cycle present, returns null.
+ * @see https://en.wikipedia.org/wiki/Cycle_detection
+ * @see https://leetcode.com/problems/linked-list-cycle-ii/
+ */
+
+function findCycleStart(head) {
+ let length = 0
+ let fast = head
+ let slow = head
+
+ while (fast !== null && fast.next !== null) {
+ fast = fast.next.next
+ slow = slow.next
+ if (fast === slow) {
+ length = cycleLength(slow)
+ break
+ }
+ }
+
+ if (length === 0) {
+ // If there is no cycle, return null.
+ return null
+ }
+
+ let ahead = head
+ let behind = head
+ // Move slow pointer ahead 'length' of cycle times
+ while (length > 0) {
+ ahead = ahead.next
+ length--
+ }
+
+ // Now move both pointers until they meet - this will be the start of cycle
+ while (ahead !== behind) {
+ ahead = ahead.next
+ behind = behind.next
+ }
+
+ // return the meeting node
+ return ahead
+}
+
+// head is a node on a cycle
+function cycleLength(head) {
+ // How long until we visit head again?
+ let cur = head
+ let len = 0
+ do {
+ cur = cur.next
+ len++
+ } while (cur != head)
+ return len
+}
+
+export { findCycleStart }
diff --git a/Data-Structures/Linked-List/test/CycleDetectionII.test.js b/Data-Structures/Linked-List/test/CycleDetectionII.test.js
new file mode 100644
index 0000000000..f741c53622
--- /dev/null
+++ b/Data-Structures/Linked-List/test/CycleDetectionII.test.js
@@ -0,0 +1,39 @@
+import { findCycleStart } from '../CycleDetectionII'
+import { Node } from '../SinglyLinkedList'
+
+describe('Detect Cycle', () => {
+ it('no cycle', () => {
+ const head = new Node(1)
+ head.next = new Node(2)
+
+ expect(findCycleStart(head)).toBeNull()
+ })
+
+ it('simple cycle', () => {
+ const head = new Node(1)
+ head.next = new Node(2)
+ head.next.next = new Node(3)
+ head.next.next.next = head.next // Creates a cycle
+
+ expect(findCycleStart(head)).toBe(head.next)
+ })
+
+ it('long list with cycle', () => {
+ const head = new Node(1)
+ head.next = new Node(2)
+ head.next.next = new Node(3)
+ head.next.next.next = new Node(4)
+ head.next.next.next.next = new Node(5)
+ head.next.next.next.next.next = head.next.next // Cycle
+
+ expect(findCycleStart(head)).toBe(head.next.next)
+ })
+
+ it('cycle on last node', () => {
+ const head = new Node(1)
+ head.next = new Node(2)
+ head.next.next = head
+
+ expect(findCycleStart(head)).toBe(head)
+ })
+})
pFad - Phonifier reborn
Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.
Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.
Alternative Proxies:
Alternative Proxy
pFad Proxy
pFad v3 Proxy
pFad v4 Proxy