Leetcode 712. Minimum ASCII Delete Sum for Two Strings

Find the minimum total ASCII value of characters that must be deleted from two strings to make them equal; this is equivalent to picking a common subsequence that maximizes the sum of kept ASCII values and is typically solved with dynamic programming (lengths ≤ 1000).