code.davidloor.com
EEasy· linked-list· recursion

Reverse Linked List

Reverse Linked List

Given the head of a singly linked list, reverse the list and return the reversed list's head.

Example

Input: head = [1,2,3,4,5] → Output: [5,4,3,2,1] Input: head = [1,2] → Output: [2,1] Input: head = [] → Output: []

Constraints

  • The number of nodes in the list is in the range [0, 5000].
  • -5000 ≤ Node.val ≤ 5000

Entry — reverseList

Grading — linked_list_value_equal over 5 tests

Stuck? Browse algorithmic patterns → or read the Python / JS foundations.
Awaiting first run
Reference solution unlocks after a run & 60 s of work.