GoLang Solution For LeetCode Problem: Remove Nth Node From End of List
Solving Remove Nth Node From End of List in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Given a linked list, remove the n-th node from the end of list and return its head.
Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the linked list becomes 1->2->3->5.
See the full details of the problem Remove Nth Node From End of List at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go