Notes/Codes/Problem links under step 10 of A2Z DSA Course: takeuforward.o... Entire playlist: • Two Pointer and Slidin... Follow us on our other social media handles: linktr.ee/take...
Пікірлер: 208
@AyushVerma-wu3nn4 ай бұрын
I think there are two points of Correction, that must have been missed : 1. hash[s[l]]++ as we are removing it while shrinking the string len. 2. we need to increment the l pointer at the end of the while loop where while(count == m). Striver did a great job! Thanks
@venkatsai23253 ай бұрын
yeah u are right
@tharungr77013 ай бұрын
can you please paste the code here
@preetkhatri25183 ай бұрын
@@tharungr7701 here you go string minWindow(string s, string t) { int n=s.size(),m=t.size(); map mp; int l{},r{},cnt{}; int len{1000000009},idx=-1; for(int i=0;i0) cnt--; if(r-l+1
@mohitsingh67173 ай бұрын
@@tharungr7701 string minWindow(string s, string t) { string result; if(s.empty() || t.empty()) { return result; } unordered_map hash; for(int i = 0 ; i < t.size(); i++) { hash[t[i]]++; } int minlen = INT_MAX; int count = 0 ; int sindex = 0 ; int r = 0 , l = 0 ; while(r < s.size()) { if(hash[s[r]] > 0 ) { count++; } hash[s[r]]--; while(count == t.size()) { if(r- l +1 < minlen) { minlen = r-l+1; sindex = l; } hash[s[l]]++; if(hash[s[l]] > 0 ) { count = count -1; } l++; } r = r + 1; } return minlen ==INT_MAX ? "": s.substr(sindex , minlen);
@KapilSharma564192 ай бұрын
@@tharungr7701 class Solution { public: string minWindow(string s, string t) { int n = s.length(); int m = t.length(); if (m > n) { return ""; } int minLength = INT_MAX; int sIndex = -1; map mp; for (int i = 0; i < m; i++) { mp[t[i]]++; } int l = 0, r = 0; int cnt = 0; while (r < n) { if (mp[s[r]] > 0) { cnt++; } mp[s[r]]--; while (cnt == m) { if (r - l + 1 < minLength) { minLength = r - l + 1; sIndex = l; } mp[s[l]]++; if (mp[s[l]] > 0) { cnt--; } l++; } r++; } return sIndex == -1 ? "" : s.substr(sIndex, minLength); } };
@nikhilaks24075 ай бұрын
Thank you striver for the awesome playlist🎉🎉🎉🎉 In the optimal approach there was a slight mistake, inside the nested loop it should be hash[s[l]]++ instead of hash[s[l]]-- and after the check for if(hash[s[l]]>0)cnt--; , a line needs to be added for l++; to shrink the window c++ updated code - class Solution { public: string minWindow(string s, string t) { if (s.empty() || t.empty()) { return ""; } vectorhash(256,0); int l=0,r=0,minlen=INT_MAX,sind=-1,cnt=0; int n=s.size(),m=t.size(); for(int i=0;i
@MayankPareek4 ай бұрын
Hey can anyone tell me where is the mistake in my code its not passing all test cases. class Solution { public String minWindow(String s, String t) { char[] hash = new char[256]; for (int i = 0; i < t.length(); i++) hash[t.charAt(i)] += 1; int l = 0, r = 0, sIndex = -1, minlen = Integer.MAX_VALUE, count = 0; while (r < s.length()) { if (hash[s.charAt(r)] > 0) count++; hash[s.charAt(r)] -= 1; while (count == t.length()) { if (r - l + 1 < minlen) { minlen = r - l + 1; sIndex = l; } hash[s.charAt(l)] += 1; if (hash[s.charAt(l)] > 0) count--; l++; } r++; } if (sIndex != -1) return s.substring(sIndex, sIndex + minlen); return ""; } }
@varun10173 ай бұрын
thank you bhaii
@mohitthakur59043 ай бұрын
@@MayankPareek facing the same error in java.
@MayankPareek3 ай бұрын
@@mohitthakur5904 take integer array instead of char array
@deeptitanpure18542 ай бұрын
@@MayankPareek While initializing the hash you should use : int[] hash = new int[256]; Was there any reason why you chose to do a: char[] hash = new char[256];
@parth_38565 ай бұрын
BTW! LOVED THE NEW WEBSITE INTERFACE.............MORE POWER AND SUCCESS TO YOU STRIVER AND HIS TEAM.
@ansulluharuka92435 ай бұрын
i am not able to login, are you able to?
@parth_38565 ай бұрын
@@ansulluharuka9243 yes! but i think there still some work is being done, so that may have caused u some problem in login, BUT let me tell you it's wind in there.
@ManishYadav-yp2mi5 ай бұрын
@@ansulluharuka9243 same here
@user-qx4cr2jh3g5 ай бұрын
same@@ansulluharuka9243
@nothingmuch1404 ай бұрын
@@ansulluharuka9243 Same broo
@sandeepyadav-es9yz3 ай бұрын
completed this playlist today 27-05-2024 thanks striver!!
@vineetsingh47075 ай бұрын
Completed this whole playlist in a single day. Thanks Striver for this. The way you teach makes me sit for long, think and implement and gradually the concepts start getting crystal clear.
@Lm-mu1up4 ай бұрын
like all of the 283? videos
@lakshsinghania3 ай бұрын
@@Lm-mu1up lmao
@Tushar_9953 ай бұрын
@@lakshsinghania Hey ! Is sequence of this playlist proper and completed ?
@lakshsinghania3 ай бұрын
@@Tushar_995 yeah it is, u can blindly follow it just the last qs which is given in the A2Z sheet is not covered here, otherwise good to go
@Tushar_9953 ай бұрын
@@lakshsinghania Ok ! I was thinking to start DSA but was confused between a LOT of channels and paid courses
@Beeplov23375682 ай бұрын
There was a slight mistake in the video. 1]. l++ in the while(cnt==m). 2]. It should be mp[s[l]]++; instead of mp[s[l]]--; in while(cnt==m) loop. string minWindow(string s, string t) { int l = 0, r=0; int n = s.size(), m = t.size(); int cnt = 0, minLen = 1e7; int startInd = -1; mapmp; for(int i=0;i
@lovegoyner74502 ай бұрын
Yep I noticed this too 😊
@rkraj33392 ай бұрын
s.substr(startind,strtind+minLen)
@lovegoyner74502 ай бұрын
@@rkraj3339 no this is wrong
@MohitReddyDadireddy-ex5ppАй бұрын
Yes
@kushmehta6823Ай бұрын
Hii i found a minor bug, i guess the corrected version should be a bit like this if (mp.find(s[l]) != mp.end()) { mp[s[l]]++; if (mp[s[l]] > 0) cnt--; } because we first have to check whether the character that my left pointer points to even exists in the string t or not if it does not then i dont think i should decrease the count because i still have substrings to measure
@nuraynasirzade4 ай бұрын
The new website is just amazing! I don't have words to say!!!!!! AMAZING!🤩🤩🤩and all of that for free!
@anubhabdas95532 ай бұрын
Completed the playlist within a day. Sliding window is usually an easier topic as it is totally intuition based, but to identify the patterns and making a structure for all the solutions, you made it look like piece of a cake. Thanks Striver
@captain-ne8qy2 ай бұрын
Why do we store the starting index in brute foce approach ? Can you please explain it to me?
@anubhabdas95532 ай бұрын
@@captain-ne8qy in the question we have to return our resultant substring right? So here we are iterating and all. Everything is fine but to return the substring, what do we want .....the first index of the substring, that is from where the substring is starting and the size so that we can calculate at what index the substring is ending, that's why we are storing both the starting index and size of the substring
@captain-ne8qy2 ай бұрын
Thnqu for the explanation!
@nehasingh81813 ай бұрын
Amazing work, Striver! You guys are really doing a great job for us by providing such a brilliant DSA course for free. It's genuinely useful for me. Please upload videos on strings in Striver's A2Z DSA Course/Sheet.......😇
@vijeshsshetty2 ай бұрын
Best Playlist on Sliding Window. Thanks Striver !!
@soumodiptajana90012 ай бұрын
Have completed sliding window playlist. Learned many things. Thank you so much...
@pratikgupta73735 ай бұрын
Master of consistency🎉
@mukeshjadhav10645 ай бұрын
Hi striver , best series in the whole world and can you please bring playlist on basics of string
@Abhinavkirtisingh4 ай бұрын
Hey Striver, I watch all of your videos and love the way you explain things. I am stuck on a problem called Josephus Problem from a quite long time. Please make a video on it.
@akshatjoshi79282 ай бұрын
I enjoy grasping from your videos StriverBhai !! I wanted to highlight one mistake in code that inside while(cnt==m) you did hash[s[l]]-- but it should be hash[s[l]]++ as the condition is if(hash[s[l]]>0) cnt--; and you forgot to write l++ as well.
@popli102 ай бұрын
Thanks Striver. Will always be grateful to you big brother
@kushal82615 ай бұрын
it should be hash[s[left]]++
@AdityaGarg-hl7ri5 ай бұрын
also left++
@tharungr77013 ай бұрын
can you please paste the code here
@user-ik3qu5uy5e5 ай бұрын
loved this sliding window playlist ♥
@parassingh38773 ай бұрын
Day 2 of asking Hey Striver, When can we expect solution videos for Strings, Stack and Queues, few Recursion videos as these are on top of queue, for A to Z sheet everyone needs them Love your content and teaching methods way from Brute to Optimum teaches us alot
@Cool962673 ай бұрын
Thankyou so much Striver for all you efforts throughout in delivering us so much valuable content. Any student / working professional can now be able to transition their career without paying money for courses. Would also like your insights on the point : While preparing for interviews most of the aspirants are going through the videos solely and solving the question after completely watching the video. And also are feeling lazy trying to solve the question on our own. What is the best way to complete any topic without being lazy and how should an aspirant approach any topic/playlist?
@ManishKumar-dk8hl5 ай бұрын
recursion ki new playlist bhi le aao ( JAVA ) :---- class Solution { public String minWindow(String s, String t) { int l=0; int r=0; HashMap mpp=new HashMap(); int cnt=0; int sindex=-1; int minlen=Integer.MAX_VALUE; String st=""; for(int i=0;i
@bruvhellnah3 ай бұрын
Aur kitne playlist chahie recursion ke tujhe bhai?
@justanuhereАй бұрын
thank u
@stith_pragya4 ай бұрын
Understood...Thank You So Much for this wonderful video...🙏🙏🙏
@akashharad42033 ай бұрын
Thank you you are so much hard working keep doing we have less good resources to learn like you
@divyanshbhatt82735 ай бұрын
thank you striver for this amazing playlist !!
@user-xz5iw1wf9w5 ай бұрын
Make playlist on CP problems for each algorithms atleast 30 each topic from 1200 div to 1800div CP SHEET of yours has very less problems except for dp and math 😢
@user-fw4kz3bb4g5 ай бұрын
MUCH MUCH MUCH love for your efforts @Striver, the new Website UI Rocks!! Also, can you please tell the ETA for string playlist? I'm really holding on from watching others' videos just so that I can follow yours ;)
@zorith5 ай бұрын
i lost all my progress with the new website update, when i logged in it again and marked my progress i lost it again and it says unautorized . The old website ui was much user friendly and better . The new update just made it more complex to navigate
@aditya_raj78275 ай бұрын
yeah i also lost my progress data
@user-ik3qu5uy5e5 ай бұрын
sign out and sign in again and refresh the page
@AmruthavarshiniMavuri4 ай бұрын
you can view ur notes under saved notes
@justlc73 ай бұрын
++, lost all data, and new website doesnt save data, keeps reseting.
@hashcodez757Күн бұрын
"UNDERSTOOD BHAIYA!!"
@hetpatel73995 ай бұрын
New website is very good.... Nice work sir;🎉
@jatinsingh72093 ай бұрын
I think there is slight correction in the pseudocode, I made these corrections while doing the problem I am posting it here ya'll can refer to it if you are facing problem, " map mp; for(int i=0;i
Please make a playlist on Heaps and Priority Queue Sir. Since Placement session is going too start requesting you to please upload it soon. Please Sir.
@sparksfly4421Ай бұрын
when we are using the left iterator to pop the letter out, shouldn't we use "hash[s[left]]++" to increase the frequency of that letter in the hashmap instead and also add a "left++" after it to keep the "shrinking" going?
@--KarthikeyanS4 ай бұрын
hey Striver ,you forgot to increment the l pointer and also in hash[s.charAt(l)]--; it should decrese the number but the value is increasing (example for d -> -2 if we perform hash[s.charAt(l)]--; (-2-1 => -3) so it should be hash[s.charAt(l)]++; (-2+1 => -1) thanks for the amazing Playlist.
@mightytitan17195 ай бұрын
Bro's the 🐐
@angeldeveloper5 ай бұрын
Thanks a ton🎉🎉
@MayankPareek3 ай бұрын
Hey Striver, Its been 40 days. Please upload recursion patten wise video first . because recursion is required in advance topic like DP and graphs. So if we have recursion playlist complete we can go to DP and graph with confidence
@anmolbansal40093 ай бұрын
bhaii tu toh wo nakli binod tharu hai na😂😂......videos bnana chhodh diya kya bhaii??
@MayankPareek3 ай бұрын
@@anmolbansal4009 yes right now , I have a job in Infosys.
A little catch .......my code was not running when I am executing from j=0 for the inner loop , so if it does not work for u also, just take j=i and check other logic it will work !! below my code Brute Force class Solution { public String minWindow(String s, String t) { int length=Integer.MAX_VALUE; int start=-1; for(int i=0;i
@nareshAdhe9955 ай бұрын
Stacks And Ques Ki Playlist Lao Bhaiya Pls
@MayankPareek4 ай бұрын
Hey can anyone tell me where is the mistake in my code its not passing all test cases. class Solution { public String minWindow(String s, String t) { char[] hash = new char[256]; for (int i = 0; i < t.length(); i++) hash[t.charAt(i)] += 1; int l = 0, r = 0, sIndex = -1, minlen = Integer.MAX_VALUE, count = 0; while (r < s.length()) { if (hash[s.charAt(r)] > 0) count++; hash[s.charAt(r)] -= 1; while (count == t.length()) { if (r - l + 1 < minlen) { minlen = r - l + 1; sIndex = l; } hash[s.charAt(l)] += 1; if (hash[s.charAt(l)] > 0) count--; l++; } r++; } if (sIndex != -1) return s.substring(sIndex, sIndex + minlen); return ""; } }
@aspirant84093 ай бұрын
take Integer array instead of CharArray
@MayankPareek3 ай бұрын
@@aspirant8409 thanks brother
@shashanknakashe33392 ай бұрын
thanks striver for this problem statement here is the optimal solution with comments that will help me and you when we do revision for this type of question class Solution { public: string minWindow(string s, string t) { // if(s == t) return s; // if the both strings are equal then we dont have to go down; int cnt = 0; int minLen = INT_MAX; int l= 0; int r =0; int n = s.size(); int index = 0; //creating the hash map to keep therecord of the value unordered_map mpp; for(int i =0 ; i< t.size(); i++){ mpp[t[i]]++; //making flags so that they will help us for the count; } while(r= 0){ cnt ++; } //making the condition for the count while(cnt == t.size()){ //setting the index according the min length if(r-l+1 < minLen){ index = l; //then you update the index; } //first we get the current length and compaire it with our minLen minLen = min( minLen, r-l+1); //now we try to shrink the substring therefore we move l++; mpp[s[l]]++; if(mpp[s[l]] == 1){ cnt = cnt-1; } l++; } //after shirinking we need to extend r++; } //if wwe want to send "" string as an output if(minLen == INT_MAX) return ""; //getting the stirng by the size minLen // index to minLen; wala part return s.substr(index, minLen); } }; keep liking this comment so youtube will notify me about this imp question :) :)
@ashishpradhan6250Ай бұрын
Op...mind blowing algorithm
@priyanshugagiya45154 ай бұрын
24:40 it should be hash[s[l]]++; l++;
@mriit30254 ай бұрын
NOTE : MISTAKE in video ⚠⚠⚠⚠⚠⚠ here is the correct code : class Solution { public: string minWindow(string s, string t) { unordered_map freq; for(char c : t) { freq[c]++; } int l = 0, r = 0, minLen = INT_MAX, si = -1, cnt = 0; while(r < s.size()) { if(freq[s[r]] > 0) cnt++; freq[s[r]]--; while(cnt == t.size()) { if(r - l + 1 < minLen) { minLen = r - l + 1; si = l; } freq[s[l]]++; if(freq[s[l]] > 0) cnt--; l++; } r++; } return si == -1 ? "" : s.substr(si, minLen); } };
@oyeesharme12 күн бұрын
thanks bhaiya
@MayankPareek4 ай бұрын
Hey Striver, I know you have very busy schedule but please drop playlist quicker. Because I started Binary tree as all other playlist before it was completed. But on the hard question it require proper knowledge of Queue and Stack , Priority Queue. Which is not completed in the playlist. So learning became difficult. Hope you understand.
@tahmidhaque36605 ай бұрын
Understood better here Then Apna college channel
@brp35224 ай бұрын
Anyone else is having issues with the new website? I am seeing unauthorized. As soon as I sign it is all fine but when I go to A2Z sheet or any section of the website it says that Unauthorized. Why is it happening
@anmolbansal40094 ай бұрын
did u get the solution to correct it?
@tanaygada9142 ай бұрын
if anyone needs corrected code string minWindow(string s, string t) { int right=0, left=0, n = s.size(); map mp; for(auto i : t){ mp[i]++; } int minLen = INT_MAX; int startInd = -1; int cnt = 0; int m = t.size(); while(right0) cnt++; mp[s[right]]--; while(cnt==m){ if(minLen>right-left+1){ minLen = right-left+1; startInd = left; } mp[s[left]]++; if(mp[s[left]]>0) cnt--; left++; } right++; } if(startInd==-1) return ""; return s.substr(startInd,minLen); }
@iamnoob75933 ай бұрын
What a playlist , Amazing Thanks Striver
@subhankarkanrar9494Ай бұрын
Nice 👍🙂
@amansinghal24315 ай бұрын
Hey Striver, I am unable to login to the AtoZ dsa sheet after you updated it. Logged in through google earlier. Could you please check?
The C++ solution for reference: class Solution { public: string minWindow(string s, string t) { int left=0, right=0, n=s.length(), minLen=INT_MAX, start=-1; unordered_map freq; for(auto ch:t) ++freq[ch]; int count=freq.size(); for(right=0; right
@singhji41495 ай бұрын
Nice video, good learning, but can u cover sliding window plus binary search coding question
@thisisRandom-ut9iq19 күн бұрын
Please do string playlist!
@adityababu34052 ай бұрын
class Solution { public: string minWindow(string s, string t) { if (s.empty() || t.empty()) { return ""; } vectorhash(256,0); int l=0,r=0,minlen=INT_MAX,sind=-1,cnt=0; int n=s.size(),m=t.size(); for(int i=0;i
@akansha5385 ай бұрын
bhaiya recursion aur greedy ki bhi ek playlist bana do pls
@pushkarbopanwar32972 ай бұрын
CODE IN C++ class Solution { public: string minWindow(string s, string t) { unordered_map mpp; int l=0,r=0,c=0,m=t.size(),index,minlen=INT_MAX; for(int i=0;i
@vikkaashl4 ай бұрын
pls post java collections vidoes it will be very usefull for the people who are solving the problems in java
@debjitdutta172 ай бұрын
GOAT
@parvahuja76185 ай бұрын
thankyou so so much sir
@SuvradipDasPhotographyOfficial2 ай бұрын
class Solution { public: string func(string s, string t){ int n = s.size(), m = t.size(); int i = 0, j = 0, startindx = -1, minlen = INT_MAX, cnt = 0; map freq; for(auto a : t){ freq[a]++; } while(j < n){ if(freq[s[j]] > 0){ cnt++; } freq[s[j]]--; while(cnt == m){ if(j - i + 1 < minlen){ minlen = j - i + 1; startindx = i; } freq[s[i]]++; if(freq[s[i]] > 0){ cnt -= 1; } i++; } j++; } cout
@dasarivamsikrishna95945 ай бұрын
Bro, There is no links of gfg in strivers A2Z sheet, Please enable gfg links It could be more helpful to practice .
@techyguyaditya4 ай бұрын
Striver won't do it, because it's all about business and giventake. GFG stopped giving commissions to him, so he purged all gfg links.
@maanavgurubaxani41665 ай бұрын
bhaiya website update hone ke baad jab koi bhi topic ke article kholte hai to undefined tutorial likha ata hai....The articles are not opening.If possible please resolve this issue as soon as possible.It will be a great help.Thank you.....
@ABINITHT4 ай бұрын
striver when will you upload videos on strings in AtoZ dsa playlist,please upload the video
@sathwikakovvuri6019Ай бұрын
Impressed
@user-lt2ie8ys3n2 ай бұрын
In the first approach, the nested for loop should be from j=i to n instead of j=0 to n, because we are checking for each substring DOES ANYBODY THINKS THE SAME ?
@MayankPareek4 ай бұрын
last question video of two pointer and string playlist, drop it soon please
@vaibhavagarwal14793 ай бұрын
1 Question remains from the sheet, Completed on 26/05/2024 (10:58 PM)
@hetpatel73993 ай бұрын
Can u give me a code snippet ..
@prabhatkumarmishra47665 ай бұрын
Pro 🔥
@xavier41075 ай бұрын
Bhayy... Please do more videos on this playlist.
@Sharath_Codm4 ай бұрын
Please update string videos 😥
@mohitjangid00273 ай бұрын
Bhaiya please upload video in A2Z playlist because you only hope for me
@manishmodi86623 ай бұрын
Gen AI would change the world of learning. For one simple problem I wouldn't need to spend 20 mins watching a video. This is my hypothesis. I may be wrong.
@rock89385 ай бұрын
I am unable to login with my google account after update
@MagicDiamondUniverse5 ай бұрын
Please put separate solution videos for all the graph questions
@limitless61895 ай бұрын
string playlist when
@tejasjaulkar96585 ай бұрын
when we click on open in new tab (video)both videos started and sounds mixed together .....so may be we can inhace this loop hole of new website master
@user-un9ri4vt7l4 ай бұрын
Bhaiya are u Odia ?? I actually saw you house vlog ang got to know it. Actually I am native from Cuttack, but studing in kiit in 2nd sem. Can you plss. provide me some tips for my carrer. My branch is CSCE
@kanakagarwal12765 ай бұрын
Done
@crazydude83335 ай бұрын
Bhai dsa retain nhi hota brain me imagine karna me problem hota hai koi solution btaye
@franciskp91175 ай бұрын
Hey man can you upload the solution for minimum window subsequence also ?
@kisnagoyal96943 ай бұрын
for brute force approach, why second inner for loop is from 0 why not from i ??
@sprihaanand41282 ай бұрын
the code still works with j=i -> n-1 guess its just a typo in the video
@kisnagoyal96942 ай бұрын
@@sprihaanand4128 ohh ohk
@saravna4 ай бұрын
Having trouble in accessing the website, the progress is not getting updated, it shows "Unauthorized" error message
@kailashnaidu82685 ай бұрын
Bro i have a doubt if the hash[s[left]]-- then the character to be inserted to the hash right but hash[s[left]] to be incremented to reduce the value if it is positive then count should be decremented please resolve my doubt bro
@Myanmartiger9214 ай бұрын
Anyone completed the playlist anything that is missing?
@limitless61895 ай бұрын
we need stringsssss
@mohankkkrishna80364 ай бұрын
Would you please make a videos on strings 😊😊😊
@SOURAVROY-ko3os4 ай бұрын
In the Brute Force Solution 'j' should be start from 'i', rather than '0'.
@AyushMishra-lb6do5 ай бұрын
some issue occurs in your website take you forward when i click mark option page says unauthorised please solve it ..
@tharungr77013 ай бұрын
Guys i have small doubt, for some questions for example hash[nums[i]]++ is working .... for some it get runtime error we have to correct it to hash[nums[i]-'a'] can anyone please explain
@tharungr77013 ай бұрын
clearled after searching it for 30mins🥲 vector should be initialized to 256 to accept all upper and lower cases.
@akashsoam75814 ай бұрын
prefix sum playlist too. Please sird
@rushidesai283611 күн бұрын
So only when count is valid, you decrease the window.
@nakulprabhu29803 ай бұрын
sir can u please start strings i m a second year student and any test i give it asks for string dsa to be solved
@gvrreddy27563 ай бұрын
can some one tell why it's coming unauthrized when ever i open sde sheet in browser. The issue is been from many days
@priyankarkoley4 ай бұрын
A minor mistake at 24:28 -- it would be "hash[s[L]]++;"