Skip to interview prep
Apexed

107. Partition a linked list around a value x so that all nodes less than x come before nodes greater than or equal to x, preserving relative order.

MediumLinked lists

Technical

Write a solution in JavaScript or Python, add a few test calls that print results and press Run. This is ungraded practice: Run shows output and does not check correctness. Open the Model answer tab to compare. Your code is saved in this browser.

Tab indents · Ctrl/⌘ + Enter runs · Esc then Tab leaves the editor

Press Run to see your program’s output.

Partition a linked list around a value x so that all nodes less than x come before nodes greater than or equal to x, preserving relative order. — Data structure