##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Cost instead of count
Define = minimum ASCII sum to delete to make and equal. Base cases: (delete all of s1) (delete all of s2) If characters match: (no deletion needed).
If they don't: delete from s1 or s2, whichever costs less. Understanding this concept will help you solve more complex problems.
