/*
  Get Nth element from the end in a linked list of integers
  Number of elements in the list will always be greater than N.
  Node is defined as 
  struct Node
  {
     int data;
     struct Node *next;
  }
*/
int GetNode(Node *head, int position)
{
    Node *p = head;
    Node *q = head;
    for(int i = 0; i < position; i++){
        if(p == NULL) return 0;
        p = p->next;
    }
    if(p == NULL) return 0;
    while(p->next != NULL){
        p = p->next;
        q = q->next;
    }
    return q->data;
}