Minimum insertions for palindrome
Given a lowercase string s, return the minimum number of characters you must insert anywhere in s to make it a palindrome. For 'abca' you can insert one 'b' to get 'abcba' (or one 'a' patterns), so the answer is 1. Length up to ~1000.
Implement
min_insertions_palindrome(s: str) → intExamples
in
["abca"]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 25 min
solution.py
InputExpectedGot
["abca"]1not run yetsample