Given 2 strings determine the minimum cost required to delete characters from either string to make them equal. We also assign a particular cost to each character so that in order to remove one instance of that character from either string it will inccur that cost. Only lower-case English letters will be used. The answer is guarenteed to fit in a 32-bit integer.
Input
costs: An array of size 26 that contains the cost for each character in the order of a-z
s1: First string, with a maximum length of 1000
s2: Second string, with a maximum length of 1000
Output
Minimum cost to make the strings equal
Examples
Example 1
Input
costs = [1, 2, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
s1 = abb
s2 = bba
Output: 2
Explanation
We can remove a from both string to make bb in both strings with only a cost of 2.