Day 398

Good morning! Here's your coding interview problem for today.

This problem was asked by Amazon.

Given a linked list and an integer `k`, remove the k-th node from the end of the list and return the head of the list.

`k` is guaranteed to be smaller than the length of the list.

Do this in one pass.