Given a linked list delete nth node from the last.
Anonymous
use 2 pointers initially poointing to head of the linked list then using a for loop take one of the pointers to thenth node from there till the end of the linked list take both the pointers one at a time by the time one of the pointers reaches the end the other would have reached the nth node from the end.
Check out your Company Bowl for anonymous work chats.