Dynamic Programming21 sections · 916 units
Open in Course

LeetCode 712 Minimum ASCII Delete Sum for Two Strings - Problem Statement

LeetCode 712

This is Minimum ASCII Delete Sum from LeetCode. Given two strings, find the minimum sum of ASCII values of deleted characters to make them equal. For "sea" and "eat", delete 's' (115) from "sea" and 't' (116) from "eat". Total: 231. This is weighted Edit Distance.

Instead of counting operations, you're reducing the cost based on character values.