Technical Interview2026-08-12
Delete the k-th node from the end of a linked list (head given)
AI-Expanded — inferred from the question title, not from the original candidate report
Given the head of a singly linked list, remove the k-th node from the end of the list and return the head of the modified list. You should aim to complete this operation in a single pass using constant extra space.
Context & Summary
One-hour online interview conducted by three interviewers. Questions covered linked lists, C programming, OS concepts, bit manipulation, and puzzles.
💻 Coding practice works best on desktop.
Code editors are too cramped on mobile screens.
Loading editor...
AI can automatically infer and generate example test cases for this question based on standard algorithmic constraints.
InterviewDigest