Smallest distinct window | GeeksforGeeks Problem of The Day | Minimum Window Substring

[@probabilitycodingisfunis1]

Code CPP:
sets; unordered_mapm;
for(char c:str)
s.insert(c);
int i =0, j = 0, ans = str.size(), n = s.size();
while(i1) m[str[j++]]--;
ans = min(ans, i-j+1);
}
i++;
}
return ans;

[@yashwanthallumilli603]

Big fan madam 😊

[@khushil9988]

what if there is no such sub string exist and we have to print -1

[@sv_patil45]

@@khushil9988 it will not happens, max chance is to get ans as length of str.

[@abhishekchaudhary2726]

please update your code its give TLE

[@mohdragib9932]

This is amazing dry run of code and thank you so much

[@GopalOswal]

Great Explaination
I got stuck in the logic but after watching till Logic I can directly code without watching Line by Line Code part.
please don't stop uploading such awesome contents :)

[@raunop8208]

Ma'am aap bahot acha padhati ho, Istarted falling in love with your coding.

[@raunop8208]

shi bol rhe ekdam

[@zishan53]

Your Code explanation on compiler is osm

[@paawansingal788]

almost similar approach but without using set
int findSubString(string s)
{
// Your code goes here
int n = s.size();
int left = 0, right = 0;
int ans = INT_MAX;
unordered_map orig, freq;
int uniqueChar = 0;
for(int i = 0; i < n; ++i){
orig[s[i]] = 1;
}
uniqueChar = orig.size();
int cnt = 0;
while(right < n){
freq[s[right]]++;
if(freq[s[right]] == 1)
++cnt;
while(cnt == uniqueChar){
ans = min(ans, right - left + 1);
--freq[s[left]];
if(freq[s[left]] == 0)
--cnt;
++left;
}
++right;
}
return ans;
}

[@adeshchhajed8473]

brilliant explanation
Thanks for explaining intuition & debugging
Keep making such videos
Thanks.

[@funfacts9544]

Excellent explanation mam. Thank you so much 😍

[@subindavid4343]

This channel deserve more popularity.

[@karishmaupreti6234]

you explain so well,thank you so much!

[@JothiprakashThangaraj]

thanks for the detailed explanation!!!

[@Rounak_kumar_28]

Crystal clear explanation mam, all concepts cleared

[@srikanthkumar6842]

Great explanation with help of dry run

[@khushil9988]

thanks for such an easy explanation

[@rajendertanwar1881]

Best explanation 👌 I've found on yt❤

[@helloUser12373]

Thanks Parveen for making this! What a solution!

[@vidhanrathore5954]

Very nice explanation....
thank you so much

[@BOSS-s6w8w]

great explanation 💯💯💯💯💯💯

[@nishagawade3248]

Thanku so much didi for great explanation

[@abishekbaiju1705]

Keep the good work coming. Thanks

[@saitejajollu2288]

wonderful explanation

[@ritikrajsinha5895]

your teaching style is very lovely mam plzz make more tutorials its really amazing😇😇😇

[@gauravpatidar9146]

Its really awesome🔥🔥🔥

[@sudhanshusharma7876]

nice explanation but it gave TLE

[@RajeshKumar-pf3qp]

Great explanation mam!

[@RajeshKumar-pu3ud]

Great Explaination Dii❤❤❤❤❤❤

[@shadaabiqbal4875]

Great explanation 👏👏👏👏

[@AbhishekAnand-wy6oz]

😍😍 Great Explanation

[@alhassanecamara2095]

Very good!

[@manojkr2362]

Similar code but bit different in if i replace while
sets;
unordered_mapmp;
for(int i=0;i

[@bittupandey6645]

Keep up the awesome work alisha

[@sachinupreti7159]

worst case ,will it give O(n^2) ?
but required is O*(256*n)
please clearify it

[@siddharthkakade7779]

Gosh you are so underrated.

[@happyyaar3157]

guys use this code if TLE is appearing
int findSubString(string str)
{
set st;
for(char c: str){
st.insert(c);
}
unordered_map mp;
int i=0,j=0,ans=str.size(),n=st.size();
while(i1){
mp[str[j++]]--;
}
ans=min(ans,i-j+1);
}
i++;
}
return ans;
}

[@UmashankarYadavJE]

use unordered_set to avoid TLE

[@pulkitsharma2304]

@@UmashankarYadavJE thanks bro

[@mohitlalwani3505]

while(1){
cout

[@rajataggarwal1432]

good explanation

[@rameshnaidu5138]

Thank You Beautiful, Your explantion is as beautiful as you are. Thanks a lot

[@ashvinkumhar5819]

great explanation!!!!!!!!!!!!!

[@mr_noob6361]

Thanks didi

[@srushtinarnaware4919]

Thankyou so much

[@SimranCE-]

what for bCC string

[@SimranCE-]

and for CaABBA

[@sharangkulkarni1759]

Good

[@probabilitycodingisfunis1]

Thanks

[@Rajat_maurya]

Thank u

[@Gaurav-fb9ds]

Getting TLE

[@Gaurav-fb9ds]

Rehne do Didi mene solve kar liya Unordered_set use karke😅

[@kartikkhandelwal3518]

int findSubString(string str)
{
sets;
for(int i=0;i

[@pulkitsharma2304]

use unordered set

[@darshankalathiya8667]

greatt

[@afzal.q842]

Do u have any another social media I'd accept from linked i need to connect u there .

[@yaswanthkosuru]

age of urs

[@rukhrao4653]

🎀🙂

[@princegupta5339]

tum ittni sundar ho mai kya karu ?

[@shimlamam6066]

Or tum kya ho??

[@manojkr2362]

I want to marry u because to say that my wife is a master in DSA JUST FOR FUN 🥰

[@naveenkokku4141]

beautiful Explanation