# Problem Definition

## Description

Reverse a linked list. Do it in-place and in one-pass.

For example:

Given 1->2->3->4->5->NULL,

return 5->4->3->2->1->NULL.

## Notes

1. [MyCodeSchool video](https://www.youtube.com/watch?v=sYcOK51hl-A)
1. [LeetCode discussion](https://leetcode.com/problems/reverse-linked-list/discuss/58125)