LeetCode 2696 | Min String Length After Removing Substrings | Greedy & DP in Python | AlgoYogi

🚀 **Start Your Smart Coding Prep at** 👉 [AlgoYogi.io](https://algoyogi.io) Welcome to **AlgoYogi**! In this video, we solve **LeetCode 2696: Minimum String Length After Removing Substrings** using a clean combination of **greedy removal** and **two-pointer/stack logic** in Python. The challenge teaches you how to optimize substring deletion operations — a neat problem for string processing and algorithmic thinking. 👉 **LeetCode Problem Link:** [Minimum String Length After Removing Substrings - LeetCode 2696](https://leetcode.com/problems/minimum-string-length-after-removing-substrings/description/) --- ### ⏱️ Timestamps 0:00 Introduction 0:30 Problem Explanation & Testing Scenarios 1:00 Approach: Greedy Two-Pointer / Stack Removal 7:30 Python Code Walkthrough 10:00 Time & Space Complexity Analysis --- ### 💡 Why Watch? - Learn how to apply **greedy deletion** iteratively with a stack - Optimize on-the-fly **substring removals** without scanning repeatedly - Strengthen your problem-solving skills with **string manipulation & cleanup** --- ### 📢 Next Steps - Try related problems like: - **Make The String Great** - **Remove All Adjacent Duplicates in String** - **Backspace String Compare** 💬 Drop your version or edge-case test in the comments! 👍 Like, 💬 Comment, and 🔔 Subscribe to **AlgoYogi** for clean Python tutorials and coding prep walkthroughs! #LeetCode #Python #StringAlgorithms #Greedy #AlgoYogi #CodingInterview