Search
⌘K
Leetcode 132. Palindrome Partitioning II
Given a string s, compute the minimum number of cuts needed to partition s into palindromic substrings. This requires identifying palindromic substrings (often precomputed) and using dynamic programming to find the minimal cuts — an O(n^2) approach for n up to 2000.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.