Prepend a new head
Insert value at the front of the list.
Append a new tail
Add value after the last node.
Palindrome linked values
Check whether values read the same forwards and backwards.
Rotate list left by k
Move the first k nodes to the end (k may exceed length; use modulo).
Merge two sorted lists
Merge two ascending integer lists into one sorted list.
Remove duplicate values
Keep first occurrence of each value while preserving order.
Pairwise sum of adjacent nodes
Sum each adjacent pair; keep a lone last node as-is.
Count nodes equal to target
Count how many times target appears in the list.
Zip two linked lists
Interleave values from a and b until both are exhausted.
Split list at index
Return prefix and suffix tuples at index k.
Showing 1–10 of 10 challenges · medium · 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.