Minimum Length of String After Deleting Similar Ends | Simple Two Pointers | Leetcode 1750

[@heyOrca2711]

easy peasy!! kudh solve karne ki koshish ki par edge cases miss hogaye, T-T test cases pass ho gaye te thank you mik for covering the edge cases as well...

[@DevOpskagyaan]

Thanks as always mik. Your clear voice and way of explanation solves all doubts

[@eazy_coding]

The you explain bhai is just awsm bahut mst jabarjast

[@pranavmahendra3423]

Thank you soo much MIK for fantastic explanation

[@codestorywithMIK]

Glad it was helpful! ❤️

[@amitshukla2268]

Bhaiya aaj ke GFG POTD Ki Sare approaches ka video bna do please

[@codestorywithMIK]

Hi there, Actually I am travelling and hence a little diffuse to post videos after early morning. Let me try to make it once I get back home. Hope you understand ❤️

[@ugcwithaddi]

I watched some videos on gfg potd but none of them covers the intuition and thought process like you do. Please make a video soon on today’s problem when you get time

[@parthbhatti4151]

Longest repeating and non-overlapping substring Bring video on this as well

[@sujaydwivedi939]

Thanks a lot bhaiya

[@amankumar-ig2fe]

Thanks sirji for you provide your important time🥰🥰

[@codestorywithMIK]

Most welcome ❤️🙏

[@amankumar-ig2fe]

🥰

[@aruu346]

bhaiya can you plz make video for understanding constraints according to which we can also understand which ds can be used.and also a video for time space complexity.It is very easier to understand from ur videos.

[@codestorywithMIK]

Definitely. Let me plan that soon next week ❤️🙏

[@aruu346]

@@codestorywithMIK thankyou bhaiya pls do not forget.

[@parthbhatti4151]

can you please make video on log like if interviewer asked what is log why we required log in time complexity ? etc.... and solve 1-2 problems and we will learn to find out the log time complexity ?

[@ayushshukla1318]

Leetcode may keep going sir

[@wearevacationuncoverers]

Solved it on my own. yayyyy

[@kunalpatil.24]

Thank you!

[@codestorywithMIK]

Most welcome 🙏❤️

[@KeshavKumar-jl1ub]

thanks... very nice

[@KavyaGupta03]

@codestorywithMIK sir pls can you make video on todays GFG POTD maximum index plsss

[@codestorywithMIK]

Hi there, Actually I am travelling and hence a little diffuse to post videos after early morning. Let me try to make it once I get back home. Hope you understand ❤️

[@gauravbanerjee2898]

Thanks a lot bhaiya ❤❤

[@swagboltey102]

Me har problem apki video deke samjke karta hu par own se ni karpaata hu kya ki apki playlist follow Karu ya phir own se hi try karu

[@ishaansharma6553]

thankyou bhaiyaaaaa

[@souravjoshi2293]

easy the aaa wala 🙂

[@realmagnus230]

Plz bhaiya aja ka gfg potd video solution Bano

[@codestorywithMIK]

Hi there, Actually I am travelling and hence a little diffuse to post videos after early morning. Let me try to make it once I get back home. Hope you understand ❤️

[@realmagnus230]

@@codestorywithMIK thanks Bhai 😍

[@parthbhatti4151]

Rabin-Karp Algorithm please build video on this and special the theory part it is hard to understand

[@codestorywithMIK]

Coming this weekend (most probably sunday) My trip will be over by then 😇❤️🙏 Hope you understand

[@ugcwithaddi]

👌🏻👌🏻👌🏻

[@infinitygaming7192]

bahiaya geeksforgeeks ke bhe dala kero please

[@DeepakSingh-fd2ix]

sir please upload todays GFG POTD problem i.e RABIN KARP ALGORITHM

[@codestorywithMIK]

Coming this weekend (most probably sunday) My trip will be over by then 😇❤️🙏 Hope you understand

[@ru45098]

Is graph concepts playlist complete d?

[@codestorywithMIK]

Yes it’s almost complete. Just few advanced topics are left which I will be covering soon.

[@santhosh7042]

For follow up question why can't I use str.substring(I,j+1) for java. Is it still to use dequeue

[@codestorywithMIK]

Yep you can use that too

[@santhosh7042]

@@codestorywithMIK your videos keep motivating me and helps to understand(visulaize) the different approaches thank you so much bhaiya. Bro can you please list out greedy approaches like how to come up with solution. I'm having hard time with greedy approaches can't able to think for solution.

[@codestorywithMIK]

Thank you so much for your kind words. Let me soon plan to make a dedicated playlist for Greedy Concepts

[@santhosh7042]

@@codestorywithMIK that's great news to hear.

[@abhishektripathi3904]

Another approach with same time and space complexity: class Solution { public: int minimumLength(string s) { int n = s.length(); if(n == 1) return 1; int i = 0, j = n-1; int ans = 0; while(i

[@tutuimam3381]

❤❤❤❤❤❤

[@sakshamshrivastava3482]

timeompleity O(n^2) nhi ghogi kya 2 while loop

[@codestorywithMIK]

The time complexity of the provided code is O(n) because it uses two pointers, 'i' and 'j', to iterate through the string 's'. The while loop conditions ensure that the pointers move towards the center of the string as long as the characters at those positions are equal. In the worst case, each character in the string is visited once, leading to a linear time complexity of O(n), where 'n' is the length of the input string.

[@kashifhussain1872]

Hey, I know that you have posted dsa sheet. But I request you to post a sheet which contains only the problems you have posted their solutions. Which can be completed in 3 - 4 months. I request you to do it because I have become addicted to your videos. I am not preferring to see other you tube channel other than your channel

[@codestorywithMIK]

Hi there, This seems a good idea. As I am travelling now, let me start on this when I get back by end of this week

[@coderletscode]

Bhai you travel a lot can you give us reason of your travelling for our patient 😅

[@theOmKumar]

//APPROACH 2: deque O(N) O(N) class Solution { public: int minimumLength(string s) { deque dq; for(auto &ch : s){ dq.push_back(ch); } while(dq.front() == dq.back() && dq.size() > 1){//if size is 1 then prefix and suffix will intersect char currCh = dq.front(); while(!dq.empty() && dq.front() == currCh){//letting prefix engulf whole string dq.pop_front(); } while(!dq.empty() && dq.back() == currCh){ dq.pop_back(); } } return dq.size(); } };

[@souravjoshi2293]

thanks man

[@lakshaykumar4589]

hey can anyone please tell me the problem with this code int minimumLength(string s) { int n=s.size(); int i=0; int j=n-1; char previ='#'; char prevj='#'; while(i