Remove Nth Node from End of List

 

Naive Approach (Two Passes)

   Idea:

1. First pass: Count the total number of nodes in the list (length).

2. Second pass: Traverse again and stop at the (length - n)th node (just before the one to be deleted).

3. Update the next pointer to skip the target node.

---

   Pseudocode: Naive Approach