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).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 712. Minimum ASCII Delete Sum for Two Strings

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact