Merge Two Sorted Lists at Microsoft
Easy67.9% acceptance
This problem has 62.5% frequency at Microsoft.
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 Microsoft Questions
LRU CacheMediumAdd Two NumbersMediumMerge k Sorted ListsHardReverse Nodes in k-GroupHardPow(x, n)Medium
View all Microsoft questions