Remove the k-th node from the end of a linked list and return the head. Try to do it in one pass.
Input
k (1 ≤ k ≤ length)Output: the resulting list's values, space-separated.
1 2 3 4 5 2
1 2 3 5
1 1
1 2 1
1
Run your code against the sample tests, or Submit to run the full suite.