CareerCup

Somebody answer it.

we have to synchronize the block of code which contains linkedlist.add(node) not for the total method

Mid of linklist:
we could have two pointer
mid => increments once every
last => increments twice
when the last reaches the end of the link list, mid will hold the middle of the link list.

while(last->next != null and last->next->next !=null) {
last = last->next->next;
mid = mid->next();
}
of course this code need to improvised.