hash one list and wen u traverse other check if prest in hash On Fri, Oct 9, 2009 at 10:02 AM, ankur aggarwal <ankur.mast....@gmail.com>wrote:
> How to find the intersection point in linked list with the following > constraints > 1) one traversal for each of the lists > 2) should not find the LENGTH of the lists > 3) can USE recursion It goes like this ... > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---