Answer: HCL OA Question 2024 August | Linked List | on-campus

Solution: Merge Two Sorted Lists — Iterative Dummy Node Approach We use an iterative approach with a dummy head node. The dummy node simplifies edge cases by always giving us a valid starting point: Create a dummy node as the starting point. Use a curr pointer to build the merged list. While both lists have nodes remaining, compare the front nodes of each list. Attach the smaller node to curr and advance that list's pointer. Once one list is exhausted, ...