Palindrome partition cuts
Given a string s, partition it into contiguous substrings such that every part is a palindrome, and return the MINIMUM number of cuts needed. A single character is a palindrome; a string already palindromic needs 0 cuts. 1 <= len(s) <= 2000, lowercase letters. Example: 'aab' -> 1 (cut into 'aa' | 'b').
Implement
min_palindrome_cuts(s: str) → intExamples
in
["aab"]out1What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 34 min
solution.py
InputExpectedGot
["aab"]1not run yetsample