Merge Two Linked List

Approach Explanation (ﾉ◕ヮ◕)ﾉ*:･ﾟ✧ I created a dummy node to simplify handling the head of the merged list. I used a tail pointer to build the merged list step by step. I compared the current nodes of both lists: If list1’s value was smaller, I attached it. Otherwise, I attached list2. I moved forward in whichever list I used. When one list was empty, I attached the remaining nodes of the other list. Finally, I returned the merged list starting from dummy.next. Method Used: (〜￣▽￣)〜 Dummy node technique Two-pointer comparison In-place splicing Efficient traversal Constant space