Explain the two-pointer gap technique.
01
01
Understand the problem
linked-listtwo-pointers
02
02
Attempt it yourself
Sketch your approach before reading the solution — that's what interviews test.
Stuck? AI Nudge Available
Get a conceptual hint to guide your logic without spoiling the final implementation.
03
03
Study the solution
The solution is waiting
Give it an honest attempt first — then compare your thinking with the full walkthrough.
04
04
Read the code
Two-pointer gap
Run Playgroundclass ListNode:
def __init__(self, val, nxt=None):
self.val, self.next = val, nxt
def remove_nth_from_end(head, n):
dummy = ListNode(0, head)
slow = fast = dummy
for _ in range(n + 1):
fast = fast.next
while fast:
slow = slow.next
fast = fast.next
slow.next = slow.next.next # unlink target
return dummy.next
# --- demo ---
def build(vals):
head = None
for v in reversed(vals): head = ListNode(v, head)
return head
def to_list(head):
out = []
while head: out.append(head.val); head = head.next
return out
print(to_list(remove_nth_from_end(build([1, 2, 3, 4, 5]), 2))) # [1, 2, 3, 5]05
05
Join the discussion
Discussion (0)
Sign in to join the discussion.
No responses yet. Be the first to share what you think.