Kth Value From the End
Return the value of the node that is k places from the end, where k = 1 is the last node. The list always has at least k nodes. Try it in a single pass. The list is passed in as head.
Linked lists appear in the tests as the list of their values, like [1,2,3]. Each node is a ListNode with .val and .next; the class is already defined for you.
Example 1
head [1,2,3,4,5]
k 2
returns 4
The 2nd from the end is 4.
Example 2
head [9,8]
k 2
returns 9
The 2nd from the end is the head.
Constraints
1 <= k <= number of nodes <= 100-100 <= Node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.