Given two strings s1 and s2, return the lowest $ ext{ASCII}$ sum of deleted characters required to make both strings equal.

Constraints:

• $1 \leq$ s1.length, s2.length $\leq 1000$

• s1 and s2 consist of lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.