Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Greedy algorithms

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›Greedy algorithms

Partition Labels

intermediatelayer I9 · Greedy algorithms5 tests

Given a string s, split it into as many contiguous parts as possible so that each letter appears in at most one part. Return an array of the part lengths, in order.

  • Concatenating the parts back together must reproduce s exactly
  • Maximise the number of parts — the answer is unique
  • An empty string yields []
  • Target complexity: two passes, O(n)

Example: "ababcbacadefegdehijhklij" gives [9,7,8].

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