Call sort() to merge two sorted linked lists? (Which is what this sub-thread is discussing.)

I mean the bubblesort of a solution is to simply concentrate the two lists and call sort on the whole thing. And then move into the next ticket. If called out during code review, yell the words "premature optimization" repeatedly and then storm out.

That's for after you get the job though. During the interview you'll need to be a bit smarter and more practiced with algorithms.

It's a trick question. We would never use a linked list in the real world.

"What's a cache locality? Is it webscale?"

What domain of programming are you in that this is a common item of work you need to do?