Read the tail node value
Return the last value or None when the list is empty.
Append a new tail
Add value after the last node.
Pairwise sum of adjacent nodes
Sum each adjacent pair; keep a lone last node as-is.
Drop the tail node
Return a new list without the last node.
Showing 1–4 of 4 challenges · Linked Lists
Linked Lists — Python coding challenges
What you will find here
This page lists linked lists challenges — real Python problems you solve in the browser IDE with instant test feedback. Each challenge includes a clear brief, starter code, and automated checks.
Challenges vs tutorials and quizzes
Challenges test what you can build under constraints. For guided teaching, use our Python tutorials. For quick checks, try quizzes or copy snippets from code samples.