{"id":"floyd-cycle-detection-o1-space","text":"`hasCycle` uses Floyd's tortoise-and-hare algorithm with O(1) auxiliary space — only two pointer variables, no visited set.","truth_value":"IN","source":"entries/2026/06/06/linked-list-cycle-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"floyd-cycle-detection-o1-space","truth_value":"IN","reason":"premise"}]}}