Leetcode 131. Palindrome Partitioning

Partition the input string s into substrings so that every substring is a palindrome, and return all possible such partitions. This is typically solved by exploring an exponential search space (n ≤ 16) via backtracking/DFS with palindrome checks (often optimized by DP).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 131. Palindrome Partitioning

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact