A: Create an empty array -> Add node values to the array as iterating through the first linked list -> Then when you iterate through the second linked list the first thing you would do is check the array and see if the array contains the current node value -> If it's found then immediately return. Otherwise, just keep advancing the pointer moving to the next node and keep comparing the node values in the array. -> If the array has no same value as any node value in the second array, simply return undefined.