Reverse Linked List

Easy
Problem Statement

Reverse a singly linked list iteratively by adjusting the next pointers of each node.

Constraints

  • Reverse in-place
  • Time Complexity: O(N)
  • Space Complexity: O(1)
  • N = number of nodes
Solution