[SOLVED!] Merge Two Sorted Lists - LeetCode 21 - Java

#coding #interviews #softwareengineering
The solution to LeetCode problem 21.
Description: You are given the heads of two sorted linked lists list1 and list2.
Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists.
Return the head of the merged linked list.
Solution: I start with software engineering interview question by explaining the problem, coding the solution, running it through IntelliJ, and finally submitting it in LeetCode. Join me as I try to explain the solution and like or subscribe if you found it helpful. Thanks!
Link to Problem: leetcode.com/p...
SOCIAL
----------------------------------------------------------------------------------------------------------------
Follow me on Facebook: www.facebook.c...
Follow me on Instagram: www.instagram....
Follow me on TikTok: www.tiktok.com...
Follow me on Twitter: al...