I used to have the Same problem manhh. Thats Normal. Complete the whole series or half of the problems. then take a problem and try to solve the problem on paper and pen. For some it takes only 50 leetcode problems But for some it takes More than 200 . " Consistency is the Key". keep improving...

@@CleancodeCentral Tiru

You got selected??

@@himanshu_047 NO bro .. Im not from CS background so, my CS fundamentasl are not strong.. especially OSI, System design.. I was able to solve the current problem but messed up in system design problem.

@@himanshu_047 he's here so , you know..

Bhaiya mai abhi class 12 pass kiya haii aur abhi btech cse krne ka decide kiya hu and in jee mains meri 73 percentile bani aur abhi mai drop lu ya na lu ke doubt mw hu , ek point ye kehta hai ki college se zada skills matter krti hai agar tumhare pass skills hai to tumhari placement off campus bhi ho jayegi but ek taraf man me ye bhi hai ki kya ek baar try krna chhaiye , is taking a drop is worth it?

Hey bro , At the end of the day your skills matter more than any college bro. Yes , the top tier colleges will give you that early career boost but its you who has to push yourself. Irrespective of college , if you keep yourself pushing you can do it from any college. yes you will have more difficulties , but they will definitely teach you a good lesson bro... ALL THE BEST (And if you are confident that you can do better by taking drop, go for it. You are still young, don't think much about outside noise. At the end of the day Its you who has to feed your family. )

how did you come to know that you have to use map or set in it.

@@jimit2795 Look I am a noob myslef, but consider this, wherever we have to maintain something in terms of numbers like k distinct, at most k, you should know it is gonna be map. Here also we have two baskets i.e. we can store maximum of two types and we have to maximize the numbers of those 2 types of fruits. So at most K type questions. Hence map/set. That's all there's to it. Don't worry keep grinding. You'll get it.

@@darkistheknight exactly your intuition is similar to mine

Right!!! but suppose the array has half no. of elements as of type 1 and the rest of the array has different types(2,3,4,.....) then while trimming down the left side we will be adding different elements to the map. So instead of O(n), it can said to be near about O(maxlen ) or O(n/2) as at max we will be storing half of the elements. What do you say?

No bro map will not store the let say 1--- element rather it will store the entry of it so it will o(1) not o(n/2) so at max map will be o(3).

No bro map will have at max 3 elements in any case

You are correct

Your code will not work for this testcase: {1, 2, 1, 2, 3, 2, 2, 1}

mostly dont ask...9 out of 10

Add "right++" after closing the bracket of "if(map.size()

If this is geeksforgeesks question the varibale n is the size of array. if questio says 2 basket then you need to use 2 instead of n the following will produce correct result: int totalFruits(int n, vector &arr) { int left = 0, right = 0, maxLength = 0; unordered_map map; while (right < n) { map[arr[right]]++; if (map.size() > 2) { map[arr[left]]--; if (map[arr[left]] == 0) { map.erase(arr[left]); } left++; } maxLength = max(maxLength, right - left + 1); right++; } return maxLength; }

then what will you do

@@parvahuja7618 I will dance

@@parvahuja7618 nagin dance 😂😂

do it yourself bro