Find 'n' th node from end of Linked List (CODE) [updated]

Find n th node from end of linked list. Write code for this.

[Alpine_Mist]

correction -- while(f->next != NULL) not while(f->next == NULL)
return p not print p
Please make a note !

[devkirandass]

I never usually you are such an amazing explainer i couldn't earned a subscriber

[azeeztaiwo]

Thanks for the great explanation, the approach is really a smart one, was able to come up with my own solution after understanding the key intuition of fast and slow moving pointers

[sayaknaiya]

I liked this video. Cuz it's was a important problem in linkedlist. But you should mathematically explain how it's working

[suchitranagarajan]

Thank you sir..very nicely explained.

[vincenr]

Thank you so much. This is amazing content. Keep up the great work!

[messageconveyor]

Negative case not write right?? Bcz, suppose list is empty mean, ? And length of the node is not enough of n mean, how do n minus of one.??Instead of print we can return is also correct right???

[bikramjitdas]

Sir I just need to ask if I revererse the linkedlist start for i=1, i<n is it possible?

[ridimamittal]

thank you sir keep making more videos, please

[chandrasekharrout]

If we do this like 1st find length of the link list then find length-n +1 nth node of the list .this way we can also find nth node from end of the list

[rajneeshpal]

osm bro....
really helpfulll
well done....
keep it up/

[MrVitaliq]

Don't you traverse the linked list almost twice? is that efficient?

[DurgaShiva]

Respected Sir, can you please make a video on topic ...pointers to structures...because i am confused that even though head, or ptr, or temp etc..they all are structure variables..and they all contain the ADDRESS to the memory,  named as the variable name..but still we need...*head, or *ptr, type variables..to store the address of the node....why..please explain???

[ronaksengupta]

But this code will fail if n is greater than the number of nodes in the linked list

[exquisiteronnie]

it does'nt work for only first 2 nodes..

[anty_]

Am I the only only one who watches Vivekanand's video in 1.25x speed? :)

[shraddhaagrahari]

it doesnt satisfy every condition. put n= 4 and then apply this you will get wrong answer

[uditasen]

can I use f!=NULL instance of f->nexrt!=NULL;

[satyabratbiswal]

your code can not be compiled for multiple test cases
see my code
Node *Temp, *P;
Temp=P=head;
int len=0;
while(Temp!=NULL)
{
Temp=Temp->next;
len++;
}
if(n>len)
return -1;
Temp=head;
while(n!=0)
{
Temp=Temp->next;
n--;
}
while(Temp!=NULL)
{
Temp=Temp->next;
P=P->next;
}
return(P->data);
}

[RenatoRegalado]

you can actually do this without the use of a second while loop:


#written in Python

def getNode(head, positionFromTail):
#initialize two pointers
p = head
q = head
diff = 0

#we begin to increment the pointers at different times
#p will increment from the start as a sort of counter
#q will increment when diff >= positionFromTail
#when p reaches NULL, q will be at the "Nth" position from tail
#and we return q.data
while(p.next is not None):
p = p.next

if (diff >= positionFromTail):
q= q.next
else:
diff += 1

return q.data