19. Remove Nth Node From End of List
![[LeetCode] 19. Remove Nth Node From End of List](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FcwoQOS%2FbtrNkCqeOfO%2FH5wxwc69ODBha1g2wmErG1%2Fimg.jpg)
[LeetCode] 19. Remove Nth Node From End of List
19. Remove Nth Node From End of List Medium Given the head of a linked list, remove the nth node from the end of the list and return its head. Example 1: Input: head = [1,2,3,4,5], n = 2 Output: [1,2,3,5] Example 2: Input: head = [1], n = 1 Output: [] Example 3: Input: head = [1,2], n = 1 Output: [1] Constraints: The number of nodes in the list is sz. 1