Problem
Solution
Same method as the Remove Nth Node From End of List , except we have a third pointer that points to the Nth value from the start of the list.
Time Complexity
O(N)
Space Complexity
O(1)
'CODE > Algorithms & Data Structures' 카테고리의 다른 글
| [Coderust] Sort a Linked List Using Merge Sort (0) | 2022.05.22 |
|---|---|
| [Coderust] Merge Two Sorted Linked Lists (0) | 2022.05.22 |
| [Coderust] Remove Nth Node From End of List (0) | 2022.05.18 |
| [Coderust] Intersection of Two Linked Lists (0) | 2022.05.17 |
| [Coderust] Remove Duplicates from a Linked List (0) | 2022.03.10 |