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).