LeetCode Minimum ASCII Delete Sum Solution

✏️ DSA Diary Day 16/100 📚🔤: Solving LeetCode’s “Minimum ASCII Delete Sum for Two Strings” 🚀✨ Today I worked on a Dynamic Programming + String Optimization problem on LeetCode 🔥👇 👉 Minimum ASCII Delete Sum for Two Strings This problem beautifully shows how DP helps minimize deletion cost while preserving the maximum common structure between two strings 🧠💡 🔹 My Approach 🛠️🧠 I used Bottom-Up Dynamic Programming (Tabulation) 🔽👇 🔸 Step 1: Define the DP Idea 📌 Instead of directly calculating what to delete, I focused on maximizing the ASCII value of the common subsequence between both strings. The more valuable the common part is, the less we need to delete 🔁✨ 🔸 Step 2: Decision Making 🔍 At every character comparison: 1️⃣ If both characters match → Add their ASCII value to the total 2️⃣ If they don’t match → Carry forward the maximum value from previous comparisons This is similar to the Longest Common Subsequence (LCS) concept, but with weights (ASCII values) instead of length 📈 🔸 Step 3: Getting the Final Answer 🧮 We calculate the total ASCII value of both strings, then subtract twice the value of the common subsequence. This ensures: ✔ Only unnecessary characters are deleted ✔ The deletion cost is minimum #LeetCode 🚀 #Java#DSA 🧠 #DynamicProgramming 📊 #ProblemSolving 💡 #CodingChallenge 💻 #100DaysOfCode 🔥 #DSADiaryByRethanya#Strings 🔤 #Tabulation 🧩 #LearnInPublic 📢 #TechJourney 🚀

  • No alternative text description for this image

I am amazed to see your code, I have written 2 page db solution, and on top of that that doesn't work for all cases

Like
Reply

To view or add a comment, sign in

Explore content categories