Partition List

Given the head of a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the nodes in each of the two partitions.

Constraints

The number of nodes in the list is in the range [0, 200].
-100 <= Node.val <= 100
-200 <= x <= 200

View editorial solution

Saving… · 13 lines

# Definition for singly-linked list.

# class ListNode:

# def __init__(self, val=0, next=None):

# self.val = val

# self.next = next

class Solution:

def partition_list(self, head: ListNode, x: int) -> ListNode:

class ListNode:

def __init__(self, val=0, next=None):

self.val = val

self.next = next

Console

Click Run to execute sample tests.