CareerCup

Can you explain the problem little bit more. It seems that services are like a circular queue, and the order are put in one by one. now when m>n then you dont have services left to process the order. It can be solved if you dynamically add few more services.
Thanks,
DKJHA

Hi , Can you explain it little bit more. Do you mean there will be 10 nubmers contineously decreasing/increasing order?
If this is the case then it is wrong. I can have all the hundred number 1,2,3,4,5...
and i will just flip 2,1,4,3,6,5 and so on.
Thanks,

The question is not clear but It is possible that
A->next = B, B->next=C; C->next=D and so on.
Later you have another node say,
T->next= C. What would you say to this. It means the second linked list somewhere is going to join another list.

Just to update, keep on moving one node at a time and keep on comparing it.

hi,
I assume that it is a single linked list. Now If the two list is intersecting then they will have the single tail. so just go to boths tail and compare it.

How to find the point of interesection.
1) Find the length of both the list. let us say M and N.
2) now let us say M is bigger one. then find out the difference. d=M-N.
3) mow move d pointer on the bigger list.

now onward both this list has same length and they are going to merge also. So just move one node on both the list and compare nodes value. It will give u the node u are looking for.

thanks,
DD>