Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Linked lists

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Linked lists

Partition List

intermediatelayer B9 · Linked lists5 tests

Given a list and a value x, rearrange it so that every node with a value less than x comes before every node with a value greater than or equal to x.

  • The relative order within each group must be preserved — this is a stable partition
  • No node with value x itself is special; it belongs in the second group
  • Return the head of the rearranged list

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen