##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
LeetCode 583
Solve Delete Operation for Two Strings from LeetCode. Given two strings and , find the minimum number of deletions to make them equal. You can only delete characters, not insert or replace.
This connects directly to LCS. If LCS has length , you need to delete characters from and from . Total deletions: . Work through examples by hand before coding.
