A fresh mix drawn from the full set — given a problem's title and prompt, name the primary algorithm or, for code questions, pick the implementation that actually solves it. New shuffle every reload, so no two runs are the same.
Question 1 / 20Score: 0 / 0
QUESTION 01 · ● EasyNAME THE APPROACH
#21 · Merge Two Sorted ListsGiven two sorted linked lists, weave them into one sorted list by repeatedly plucking the smaller front node. A dummy head eliminates all edge cases and lets tail.next do all the work.Which algorithmic approach does this primarily use?