Partition List Problem

Partition List Problem — ExecCode Easy DSA Practice

Solve the Partition List problem on ExecCode. Free online easy DSA practice in Linked List. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are 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. Your task is to you should preserve the original relative order of the nodes in each of the two partitions. Return the required answer exactly as shown in the examples.

Examples

Input {"values": [1, 4, 3, 2, 5, 2], "x": 3}; Output 1 2 2 4 3 5. Input {"values": [2, 1], "x": 2}; Output 1 2. Input {"values": [0], "x": 1}; Output 0

Constraints

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

Practice Partition List free on ExecCode. Browse DSA problems, topic map, and placement guides.