Practice Sort List
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given the head of a linked list, return the list after sorting it in ascending order. Example 1: Example 2: Example 3: Constraints: Follow up: Can you sort the linked list in O(n logn) time and O(1) memory (i.e. constant space)?
Source: Sort List on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
head = [4,2,1,3]
Output
[1,2,3,4]
# Example 2
Input
head = [-1,5,3,4,0]
Output
[-1,0,3,4,5]
# Example 3
Input
head = []
Output
[]
Constraints
The number of nodes in the list is in the range [0, 5 * 10^4].
-10^5 <= Node.val <= 10^5
Related LeetCode Problems
Practice more problems similar to Sort List.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.