Find Kth or Nth Last Node from Linked List in Single Pass | O(n) Time Complexity |
A Linked List (or more precisely a Singly Linked List) is a collection of nodes where each node has a pointer to the next node in the list.
You can traverse through the linked list from head to tail. But you cannot go from the tail to head.
So how do you find the Kth or Nth last node from the Linked List in a Single Pass?
You need to use a two-pointer approach to solve this problem.
And that is what we are going to look at in this video.
Other reference video for the two pointer approach:
• Find Middle Node of a Linked List in ...
++++++++++++++++++++++++++++++++++++++++++++++++++++
My General Tech Blog : http://www.progressivecoder.com
My Web Dev Focused Blog : https://www.progressivewebninja.com
My Github URL : https://www.github.com/dashsaurabh
#linkedlists #datastructures #algorithms
++++++++++++++++++++++++++++++++++++++++++++++++++++
Sound Courtesy - https://www.bensound.com/
