Pergunta de entrevista da empresa Amazon
The coding interview was about 5 different smaller problems. One of them was finding the center node in a linked list, the others we're a bit harder but similar in length of solutions.
Resposta da entrevista
Sigiloso
8 de ago. de 2019
Traverse linked list using two pointers. Move one pointer by one and other pointer by two. When the fast pointer reaches end slow pointer will reach middle of the linked list.