A medium Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

medium

Seniority

L3

Problem

Given a list representing a linked list (nodes in order), return the value of the last node. Return None if the list is empty. Implement tail-recursively.

Summary

Navigate to the end of a linked list using recursion.

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.