Tag: leetcode 19

Given the head of a linked list, remove the nth node from the end of the list and return its head. Example: Input: head = [1,2,3,4,5], n = 2 Output: [1,2,3,5] Explanation: The second node from the end is 4, so we remove it and link 3 to 5. Example:…