The Tail Finder

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

Domain

Python

Difficulty

medium

Seniority

junior, mid

Problem

Implement a function that finds the last element of a linked list using tail recursion. The linked list is represented as a Python list where each element is a node value. Return the value of the last node, or None if the list is empty.

Practice This Problem

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