Palindrome insertions
Given a string `s`, return the minimum number of single-character insertions (at any positions) needed to turn it into a palindrome. You may insert any characters anywhere.
Implement
min_palindrome_insertions(s: str) → intExamples
in
["zzazz"]out0What 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 25 min
solution.py
InputExpectedGot
["zzazz"]0not run yetsample