LeetCode 712: Minimum ASCII Delete Sum for Two Strings | DP & LCS Pattern Explained | C++

LeetCode 712: Minimum ASCII Delete Sum for Two Strings | DP & LCS Pattern Explained

Timestamps:
00:00 - Problem Breakdown
1:45 - Solution Discussion

Code (C++):
https://leetcode.com/problems/minimum...

In today's LeetCode Problem of the Day (POTD), we solve "Minimum ASCII Delete Sum for Two Strings" (LeetCode 712).

If you struggle with Dynamic Programming (DP), this video is for you! I break down this problem in very simple English and show you exactly how it relates to the classic Longest Common Subsequence (LCS) problem.

💡 What you will learn in this video:
1. How to break down the problem statement simply.
2. Intuition: How to think on your own and realize this is a DP problem.
3. The connection between this problem and Longest Common Subsequence (LCS).
4. Step-by-step code implementation (Beginner Friendly).

Problem Overview: We are given two strings and need to delete characters so that the two strings become equal. The goal is to minimize the sum of ASCII values of the deleted character

Approach: Since we want to keep the characters with the highest ASCII values to minimize the deleted sum, this problem is essentially finding a variation of the Longest Common Subsequence, but weighted by ASCII values. We will explore the Recursive approach and then optimize it using Dynamic Programming (Memoization/Tabulation).

Problem link:
https://leetcode.com/problems/minimum...

Hashtags: #leetcode #dynamicprogramming #LCS #codinginterview #softwareengineering #leetcodepotd #python #java #cpp #algorithms