CareerCup

reverse(node *p)
{
node *q,*x;
q=NULL:
for(i=0;1<linklength;i++)
{
x=p;
while(x->next !=p)
{
x=x->next;
}
printf("%d",x->info);
p=x;
}

node* Reverse(struct node* current) {

struct node* result = NULL;
struct node* next;

while (current != NULL) {
next = current->next; // tricky: note the next node
current->next = result; // move the node onto the result
result = current;
current = next;
}

return result

}

void reverse(node ** head)
{
    node * prev = NULL;
    while(*head)
    {
         node * next = (*head)->next;
         (*head)->next = prev;
         prev = *head;
         *head = next;
    }
    *head = prev;
}

2 answers rec and iterative. No null pointer check, you can add it.

node* reverseLinkedList(node* input){	
	node* temp=NULL;
	node* first=NULL;
	if(input->next!=NULL)
		temp=reverseLinkedList(input->next);	
	else		
		return input;	
	input->next->next=input;
	input->next=NULL;
	return temp;
}

node* reverseLinkedListIterative(node* input){
	node* result=NULL;	
	node* next=NULL;

	while(input!=NULL){
		next=input->next;
		input->next=result;
		result=input;
		input=next;
	}
	return result;
}

I checked this code is working fine ..
void reverserLinkedList(Node **head)
{
Node *prev=NULL,*tmp=NULL;
while(*head)
{
tmp = (*head)->next;
(*head)->next = prev;
prev = *head;
*head = tmp;
}
*head = prev;
}

list* reverse(list *l){
list*a=NULL, *b=l;
while(b){
swap(a,b->next);
swap(a,b);
}
return a;
}

public void reverse(Node node)
{
	Node pointer = node;
	Node node2 = null;
	while(pointer != null)
		{
			node2 = new Node(pointer.getData(),node2);
			pointer = pointer.next;
		}
}

So this will generate reverse of a linked list in one simple iteration.