do dfs traversal along the two log files and maintain a stack in which push the element from 1st log file and if matching id in 2 log file is found pop it and display it to user but dis 'll take extra stack space ,,,
another sol.. maintain a bit array for any of the log file and while doing BFS traversal if any nth common id found set the nth bit in bit array and thus retrieving the data where the bit is set.... On Mon, Sep 26, 2011 at 1:32 AM, khushboo lohia <[email protected]> wrote: > Are the customer id's in 2 files in sorted order ? > > > On Mon, Sep 26, 2011 at 1:29 AM, Ankur Garg <[email protected]> wrote: > >> You are given 2 log files each having 1 billion entries and each entry has >> a unique customer id.You need to print the records in two files which are >> common. >> >> >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
