Home/ Questions/Q 578741
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-13T14:17:34+00:00

Given two sorted linked lists, L1 and L2, a solution to compute their intersection

  • 0

Given two sorted linked lists, L1 and L2, a solution to compute their
intersection L1 intersection L2.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team
    L1_node = L1.head;
L2_node = L2.head;
Result = new SList;
while L1_node != NULL and L2_node != NULL:
  if L1_node.value == L2_node.value:
     Result.append(L1_node.value)
     L1_node = L1_node.next
     L2_node = L2_node.next
  elif L1_node.value < L2_node.value:
     L1_node = L1_node.next
  else
     L2_node = L2_node.next

    (Translate to C yourself.)

    • 0