Minimum Length of String After Deleting Similar Ends | Simple Two Pointers | Leetcode 1750
207Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
This is the 7th Video of our Playlist "Two Pointers : Popular Interview Problems".
In this video we will try to solve a good problem : Minimum Length of String After Deleting Similar Ends | Leetcode 1750
Share your learnings on LinkedIn, Twitter (X), Instagram, Facebook(Meta) with #codestorywithmik & feel free to tag me.
I will explain the intuition so easily that you will never forget and start seeing this as cakewalk EASYYY.
We will do live coding after explanation and see if we are able to pass all the test cases.
Also, please note that my Github solution link below contains both C++ as well as JAVA code.
Problem Name : Minimum Length of String After Deleting Similar Ends | Leetcode 1750
Company Tags : AMAZON
My solutions on Github(C++ & JAVA) : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Two%20Pointer/Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends.cpp
Leetcode Link : https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/
My DP Concepts Playlist : https://youtu.be/7eLMOE1jnls
My Graph Concepts Playlist : https://youtu.be/5JGiZnr6B5w
My Recursion Concepts Playlist : https://www.youtube.com/watch?v=pfb1Zduesi8&list=PLpIkg8OmuX-IBcXsfITH5ql0Lqci1MYPM
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Subscribe to my channel : https://www.youtube.com/@codestorywithMIK
Instagram : https://www.instagram.com/codestorywithmik/
Facebook : https://www.facebook.com/people/codestorywithmik/100090524295846/
Twitter : https://twitter.com/CSwithMIK
Approach Summary :
The provided approach defines a class named `Solution` with a method `minimumLength`, which calculates and returns the minimum length of a string `s` after repeatedly removing identical characters from both ends. The algorithm uses two pointers (`i` and `j`) starting from the beginning and end of the string and iterates until these pointers meet or the characters at their positions are different. It then removes consecutive identical characters from both ends, updating the pointers accordingly. The final result is the length of the remaining substring after these removals. The `main` method demonstrates how to use this solution by providing an example input string.
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
✨ Timelines✨
00:00 - Introduction
04:39 - 2 Pointers
06:46 - Dry Run
10:27 - Corner Case
14:54 - Live coding
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge#leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips #interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa #2024 #newyearZ