/* Ajith - Syntax Higlighter - End ----------------------------------------------- */

## 11.14.2012

### Finding Nth node from end of a Singly Linked List

Previous Article: Finding first node in a Loop in Singly Linked List.

Solution 01 - Brute Force Approach:
1. Start at First Node of the List (call it curNodePtr).
2. Assign curNodePtr to tmpPtr and count number of nodes after the curNodePtr.
3. If number of nodes after curNodePtr are equal to N nodes or tmpPtr reaches END then break. If tmPtr reaches END but count not equal to N then return since we can't find the Nth node from the end of the Singly Linked List.
4. Move the curNodePtr one step forward in the Linked List i.e curNodePtr now points to its next node in the list and start again from STEP-2.

## 11.07.2012

### Reversing a Singly Linked List

Previous Article: Deleting a Node from a Singly Linked List.
Next Article: Detecting a Loop in Singly Linked List - Tortoise and Hare.

Let us see how to reverse a Singly Linked List.

Pseudocode:
cur_ptr = HEAD->NEXT
prev_ptr = NULL

forever:

if cur_ptr == NULL
break

tmp_ptr  = prev_ptr
prev_ptr = cur_ptr
cur_ptr  = cur_ptr->NEXT

prev_ptr->NEXT = tmp_ptr

HEAD->NEXT = prev_ptr
Complexity:
Time Complexity: O(n)
Space Complexity: O(3)

If we try on the example in Figure-1 we get the output as shown below

 Figure-2: After reversing the Singly Linked List

Previous Article: Deleting a Node from a Singly Linked List.
Next Article: Detecting a Loop in Singly Linked List - Tortoise and Hare.