{"id":"single-pass-no-length","text":"`middle_of_the_linked_list` finds the middle in exactly one pass (n/2 iterations) without computing the list's length, using the slow/fast pointer technique.","truth_value":"IN","source":"entries/2026/06/06/middle-of-the-linked-list-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"single-pass-no-length","truth_value":"IN","reason":"premise"}]}}