Merge Two Sorted Lists at Bloomberg
Easy67.9% acceptance
This problem has 75.0% frequency at Bloomberg.
Problem Description
You are given the heads of two sorted linked lists `list1` and `list2`. Merge the two lists into 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_.
Read full problem and hintsTopics
Also asked at 39 companies
More Bloomberg Questions
Add Two NumbersMediumLRU CacheMediumDecode StringMediumFlatten a Multilevel Doubly Linked ListMediumMerge k Sorted ListsHard
View all Bloomberg questions