Given the head of a linked list, sort it in ascending order using O(n log n) time and O(1) memory.
Input: 4→2→1→3 Output: 1→2→3→4 Input: -1→5→3→4→0 Output: -1→0→3→4→5
Unlock hints progressively — start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features