148. Sort List

LeetCodeLinked ListTwo PointersDivide and ConquerSortingMerge SortOpen on judge ↗

Given the head of a linked list, return the list after sorting it in ascending order. 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 * 104]. - -105 <= Node.val <= 105 Follow up: Can you sort the linked list in O

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI