2,383 views
1 votes
1 votes
Given two unsorted singly-linked lists each with n distinct elements. There exists an efficient intersection algorithm, that computes and returns a new list with common elements between the input lists. How much time does the intersection algorithm requires in worst case, if it is allowed to use constant extra space only?

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
4