C Puzzles

something now in my mind..

use two stacks.
push nodes of linked list to the respective stack.

pop these stacks and compare.
initially we will get common nodes.
find the point where it is different.

complexity is O(n)
 

another solution without any major datastructure

length_a= get_length(heada);
length_b= get_length(headb);

delta = |length_a - length_b|;

if(length_a > length_b) {
step heada by delta
} else {
step headb by delta
}

now the length of both are same.

while(heada){
if (heada=headb)
print it
heada=heada->link;
headb=headb->link;
}