#AshokSoftwareDeveloper
1. Initialize two pointers to the head of LL.
2. Increment firstptr by n-1 nodes.
3. Increment both pointers until firstptr is pointing to last node(firstptr.next is not null).
4. Return secondptr(pointing to nth node from last)