Delete for equal strings
Given two strings s1 and s2, you may delete characters from either string. Return the lowest possible sum of ASCII codes of the deleted characters needed to make the two strings equal. The strings contain lowercase English letters, with lengths up to 1000.
Implement
min_ascii_delete_sum(s1: str, s2: str) → intExamples
in
["sea","eat"]out231What 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
["sea","eat"]231not run yetsample