What parts were unclear? I'm happy to clarify.

It's been 2 years doing leetcode and i am still not able to solve many problems what i would recommend is resolve those problems on your own again. Don't judge yourself if you want to be a software developer not some DSA/CP Guy. It just one of the metric used in the industry to hire not the only metric. Also if you really want to be IT then get in habit of this feeling because things will not happen in one go , you will not be always knowing the stack before hand there are many uncontrollable variables. Keep Grinding!!

Thanks alot bro for clearing my doubts. You are a life saver. I was really feeling that maybe I am not that smart. Can you suggest me what should I focus more on as a beginner.

I can tell you why i used because we need to get the car that will be stopping other car from going forward so that we get the group of car.

I started it during my third year of college then I had time and space to do things now coming to Bangalore (internship) things are not great currently figuring out things It feels great that people like my videos there are haters also I am just an average engineering kid there are people way better than me I would you urge you to keep learning from them Money can't buy happiness but it can buy peace and time so keep grinding !!

Plz use pen and paper to count the number of subarrays from the whole array with at most sum equal to k (sum can be 0,1,2..k) then you will find out that doing cnt+=end-start is doing the same things of counting all the subarrays

we can do it using map too

class Solution { public: int characterReplacement(string s, int k) { map<char,int> mp; int i=0,j=0; int ma=INT_MIN,maxi=INT_MIN; while(j<s.size()) { mp[s[j]]++; ma=max(ma,mp[s[j]]); if(j-i+1-ma>k) { mp[s[i]]--; ++i; } maxi=max(maxi,j-i+1); ++j; } return maxi; } };

Plz use pen and paper to count the number of subarrays from the whole array with at most sum equal to k (sum can be 0,1,2..k) then you will find out that doing cnt+=end-start is doing the same things of counting all the subarrays

Thanks for the support plz consider subscribing to the channel if you haven't Keep Grinding!!

Thanks for the support plz consider subscribing to the channel if you haven't Keep Grinding!!

Thanks means alot ... Please consider subscribing to the channel if you haven't. Keep Grinding!!

Thanks for the comment that's what i am trying to do. At least I am not faking it and have the guts to accept it openly and work on it

In line 16 of the code I am doing that After decreasing the window size and checking what is the current max after the shrink

Thanks for the motivation and watch time

I will start uploading again soon !!

@@_compl3x_ Pls upload more dp and monotonic stack,queues type of problems. Thanks. Your videos were super helpful

What I am trying to say is to reach (2,2) 4 with help +5 we can reach it But not meaning that we will use all +1 only required to increase the freq of that number over there it was 2

For ex atmost 2 means 0,1,2 and atmost 1 means 0,1 and if you remove 0,1 case from atmost 2 You will get exactly 2

@@_compl3x_ Thankyou

Please consider subscribing to the channel if you haven't …. Keep Grinding

For ex atmost 2 means 0,1,2 and atmost 1 means 0,1 and if you remove 0,1 case from atmost 2 You will get exactly 2

Thanks for your feedback 1. There is no better way to grow as a person than to do everyday something you hate.” ~ David Goggins 2. Never made these with the intent that people will watch my videos it is just to improve my communication skill 3. And if you want to give judgment watch my latest videos, whether I have to switch to Hindi or not 4. Every pro was once a beginner 5. Showing the real process of how normal people start and get going unlike others that portray picture-perfect scenarios

Glad you liked it...Please consider subscribing to the channel if you haven't...keep grinding

We are using max heap and top is greatest if something is not smaller than the greatest among k then how it can be smaller than the rest Plz use pen and paper to dry run

@@_compl3x_ your approach 2 code is not working on leetcode