# Delete Node in a Linked List (LeetCode 237): Interview Notes ## Problem You are given only the node to delete (not the head). The node is not the tail. Remove it from the list in-place. ## Approach Copy `node.next.val` into `node.val`, then bypass the next node: `node.next = node.next.next`. You cannot free the given node without its predecessor, so overwrite instead. ## Complexity Time O(1), space O(1). ## Practice tip Explain why this trick fails for the tail, then practice follow-ups with a [job interview AI assistant](https://www.linkjob.ai/). *Disclosure: I work on Linkjob AI.*