LeetCode 19 | Remove Nth Node from End of List | Algorithm Explained (Java)w
Running Time: O(N)
Space Complexity: O(1)
The description reads:
"Given a linked list, remove the n-th node from the end of list and return its head.
Example:
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.
Note:
Given n will always be valid.
Follow up:
Could you do this in one pass?"
Always be pluggin:
Github: https://github.com/xavierelon1
Github HackerRank Solutions: https://github.com/XavierElon1/Hacker...
Github Leetcode Solutions: https://github.com/XavierElon1/LeetCo...
Facebook: / xavier.hollingsworth.3
Instagram: / xavierelon
LinkedIn: / xavier-hollingsworth-524144127
Twitter: / elon_xavier