LeetCode 2696 | Min String Length After Removing Substrings | Stack & Two Pointers C++

Welcome to DecodeWithPriyo! 🎉 In today’s video, we’ll be solving the LeetCode Problem of the Day: 2696. Minimum String Length After Removing Substrings. I’ll be walking you through two different approaches: one using a stack and the other using two pointers. This is a great problem to strengthen your understanding of string manipulation techniques and efficient problem-solving strategies.

🔑 Approach 1 (Stack):

1. Traverse the string and use a stack to push and pop characters when specific patterns (AB or CD) are found.
2. If a pattern is found, the top of the stack is removed. Otherwise, we keep pushing characters onto the stack.
3. At the end, the size of the stack gives the length of the remaining string.

⏳ Time Complexity: O(n), where n is the length of the string, since each character is pushed and popped from the stack once.

🧠 Space Complexity: O(n), in the worst case, where no patterns (AB or CD) are found and all characters are stored in the stack.

🔑 Approach 2 (Two Pointers):

1. Use two pointers (i and j) to iterate through the string.
2. Compare characters at i and j to check for patterns (AB or CD). If a pattern is found, reduce i; otherwise, move i forward and overwrite the string at i with the character at j.
3. The result is the length of the modified string after processing.

⏳ Time Complexity: O(n), where n is the length of the string, as each character is visited once by both pointers.

🧠 Space Complexity: O(1), since we modify the input string in place without extra space.

If you found this video helpful, don't forget to like, subscribe, and leave a comment on how you approached this problem. Let’s keep decoding challenges together! 🚀
#leetcodedailychallenge #interview #education #coding #programming #github #