Zero To DSAZero To DSA
Privacy Policy
Merge Two Sorted Lists

Reverse Linked List

easy
Time: O(n)
Space: O(1)

Given the head of a singly linked list, reverse the list and return the new head.

Constraints

  • The number of nodes is in the range [0, 5000].

Examples

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