NeetCode #498LC-131MediumBacktrackingNC 150NC 250
← Back to All Problems#498 · #131 · Palindrome Partitioning(分割回文串)
📌 Problem Statement & Constraints
Given a string
s, partition it so that every substring is a palindrome. Return all possible partitionings. Constraints: 1 <= s.length <= 16.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!