Count nodes in a linked list
Return how many values appear in the list (one per node).
Read the head node value
Return the first value or None when the list is empty.
Read the tail node value
Return the last value or None when the list is empty.
Reverse a linked list copy
Return a new list with node values in reverse order without mutating the input.
Concatenate two linked lists
Append the second list's nodes after the first and return a new list.
Value at index n
Return the value at zero-based index n or None if out of range.
Middle node index
Return the floor middle index for a non-empty list.
Maximum node value
Return the largest integer or None when empty.
Remove the head node
Return a new list without the first node.
Split list at index
Return prefix and suffix tuples at index k.
Second node value
Return the second value or None if fewer than two nodes.
Drop the tail node
Return a new list without the last node.
Join node values with arrows
Format string node values as 'a -> b -> c'; empty list returns ''.
Compare two linked lists
Return True when both lists have identical values in order.
Showing 1–14 of 14 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.