Pergunta de entrevista da empresa S&P Global
algorithm to reverse a singly linkedlist. (most efficient way)
Resposta da entrevista
Sigiloso
18 de fev. de 2010
running in O(n). using iterator to rearrange the nodes.
algorithm to reverse a singly linkedlist. (most efficient way)
Sigiloso
running in O(n). using iterator to rearrange the nodes.