Palindrome partition minimum cuts
Given a string s (length 1..1000), partition it so every substring of the partition is a palindrome, and return the minimum number of cuts needed. A single character is a palindrome, so a string that is already a palindrome needs 0 cuts. Return an integer.
Implement
min_cut(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 35 min
solution.py
InputExpectedGot
["aab"]1not run yetsample