Minimum ASCII Delete Sum for Two Strings: coding question

Available question text

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

Continue with questions that share topics or the same question type.

Delete Operation for Two Strings
Coding
Minimum Equal Sum of Two Arrays After Replacing Zeros
Coding
Minimum Index Sum of Two Lists
Coding
Minimum Number of Steps to Make Two Strings Anagram
Coding

Sources · 1 reference

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

No company association
Leetcode 712. Minimum ASCII Delete Sum for Two Strings
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source

Minimum ASCII Delete Sum for Two Strings

Available question text

Related questions

Minimum ASCII Delete Sum for Two Strings

Available question text

Related questions