Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Backtracking

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›Backtracking

Palindrome Partitioning

intermediatelayer I6 · Backtracking5 tests

Given a string s, return every way of cutting it into pieces such that every piece is a palindrome.

  • The pieces of one partition must join back together to give s, in order — so the order within a partition matters
  • The partitions themselves may be returned in any order
  • A single character is always a palindrome, so at least one partition always exists
  • The empty string has one partition: the empty list, so return [[]]

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