NeetCode #332LC-86MediumLinked List
← Back to All Problems#332 · #86 · Partition List(分隔链表)
📌 Problem Statement & Constraints
Given the head of a linked list and a value
x, partition it so that all nodes with values less than x come before nodes with values greater than or equal to x, preserving the original relative order within each part. Constraints: the number of nodes is in [0, 200], -100 <= Node.val <= 100, -200 <= x <= 200.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!