Merge Motley Title with airSlate SignNow

Merge motley ordered

hey guys it's me again and let's solve another leak code problem merge two sorted lists so this is an easy problem it's a mainly fundamental problem there's nothing crazy about it but it's a pretty good problem to understand some basic stuff so we're given two linked lists right so this is the first one this is the second one both of them are already sorted and we just want to merge them into an output linked list the only catch is that we have to use the original nodes right like we can't create copies of the nodes so let's say we have list one and we have list two i'm just going to take them exactly from the example that they gave us so we can actually focus on the general algorithm itself so your intuition will probably solve this problem for you so it's basically since the lists are sorted we start at the beginning of both of them right now we can just compare the values so they're both one so it doesn't really matter which one we pick so we can just take uh i'll say list one right so we'll take this one and insert it in our output and then move to the next one and then just continue the algorithm the only catch here is that right now our output list is empty right so this kind of gives us an edge case because our we don't even have a list itself yet so what i like to do is just create like a dummy node so this is a pretty common technique and you avoid any edge cases you avoid the edge case of the initial empty list so let's say we start out with a list right this is a dummy node it can have any possible value so now we're going to insert one into our list now we're going to compare two values of two and one in this case the value from list two is smaller so we're gonna take it insert it into our output list one now we're gonna be comparing these two so two and three the value from list one is smaller we take it and insert it into our output two and then of course we can move to the last value in list one so now we're at four and three which one of them is smaller of course three which is the value in list two i'm running out of space but i think you get the idea at this point so now we're at the two last values from each list we'll just take the value from list one and add it which is four they're both the same so it doesn't matter now this is the last edge case that we have to worry about so now for list one there aren't any more values left right so we can't really continue our algorithm lucky for us...