Given two linked lists, find out IF they intersect.

Question

Jimmy · Accepted Answer

Solution 1: Traverse the first linked list and mark visited nodes. Traverse 2nd linked list of, the moment we obtain a visited node that's the intersection point. 

solution2: If size of 2 linked list are different then traverse the bigger linked list to that extent where the remaining length would be same as the smaller one. Then start traversing both the list together. The moment comment address location obtained, that intersection point.

Anonymous · Answer

Traverse both the linked lists and check if their last elements are the same (address of the elements).

Tom · Answer

HashMap map = new HashMap();
		
		for (Integer i : list1)
			map.put(i, i);
		
		for (Integer j : list2) {
			if (map.containsKey(j)) 
				return true
		}

                return false;

Amazon

Amazon Interview Question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches