20%off off — LaunchSpecial
Exercises/#146 Palindrome Partitioning
#146

Palindrome Partitioning

Hard🧩 Dynamic Programming
140 XP

Problem

Given a string s, partition it such that every substring is a palindrome. Return all possible partitions.

Examples

Input: s = 'aab'
Output: [['a','a','b'],['aa','b']]
dynamic-programmingbacktrackingstring
AI Assistant— powered by AI

Unlock hints progressively — start gentle, go deeper only if needed.

💡

Level 1: Gentle Nudge

A subtle direction

🗺️

Level 2: Approach

The algorithm to use

🔍

Level 3: Detailed

Step-by-step guidance

146 / 150

Your Solution

⚡ JavaScript

to save progress and use AI features