# Problem Definition

## Description

Given a linked list, remove the n-th node from the end of list and return its head.

**Example:**

```plaintext
Given linked list: 1->2->3->4->5, and n = 2.

After removing the second node from the end, the linked list becomes 1->2->3->5.
```

**Note:**

Given *n* will always be valid.

**Follow up:**

Could you do this in one pass?

## Notes

1. [LeetCode solution](https://leetcode.com/problems/remove-nth-node-from-end-of-list/solution/)
1. [LeetCode discussion - Simple Java solution in one pass](https://leetcode.com/explore/interview/card/top-interview-questions-easy/93/linked-list/603/discuss/8804/Simple-Java-solution-in-one-pass)