Output a single linked list in reverse, in linear time and constant space, and recursively

Question

anupam · Accepted Answer

void recursive_reverse(nodeptr inlist)
{
    if (inlist->next == NULL)
    {
        printf(" %d ", inlist->value);
        return;
    }

    recursive_reverse(inlist->next);
    printf(" %d ", inlist->value);
}

Chris · Answer

Reversing it recursively always needs at least O(n) space in memory.

mohammadkotb · Answer

here it is a java code for reversing a linked list recursively

Node reverse(Node head) {
	return reverse(head,null);
}

Node reverse(Node head,Node tail) {
	Node tmp = head.next;
	head.next = tail;
	tail = head;
	if (tmp == null)
		return head;
	head = tmp;
	return reverse(head,tail);
}

pz · Answer

void revis(Node*node, Node* ptr){
 if(node==null)return;
  revis(node->next,node);
  node->next=ptr;
}

ajs · Answer

def reverse(lst):
  if not lst or len(lst) == 1:
    return lst
  else:
    return reverse(lst[1:]) + [lst[0]]

Meta

Pergunta de entrevista da empresa Meta

Respostas da entrevista

Empresas seguidas

Buscas de vagas