Видео

Its ok ! When your exams get end plz post your solution videos regularly. I'm really missing your explanation videos 😅 and you are the only saviour of my POTDs coz I'm at learning stage, right now !! Come back soon with your awesome videos 😄 !!

Bro why are you not posting more videos🤒

Yooooooo, good to see you again bro. How are you doing? This problem was okay for me, I wish all the medium problems are like this😢😢... but I couldn't even understand some of them....😂😂😂😂. Anyways, the way you taught BFS, within couple of minutes, I just remembered how I learnt it the day before my semester exam😂😂😂😂😂😂😂. Damn, good ol' days... Probably one of the better days in my college life😂😂😂. I still remember both BFS and DFS clearly(like how it's done and what it is). The optimised 2nd way was a bit confusing, watched it again and understood🤜🏽🤛🏽. It was another quality video.... So thanks bro... Keep it up🔥🔥🔥🔥

Broooo, understanding from videos is so much better than reading dry lectures in editorial and solutions😂😂😂😂. But today, I have mixed feelings about this. Like the use of binary search, to solve this is pretty amazing🔥🔥, but then again, I have a question unanswered still after watching this... "Why do we have to invert it when k > mid or answer is in the mirror world?"😢😢 I could think of some explanations maybe, but none of my self-explanation is not concrete enough😢😢. I don't want to be rude, it's just that this will keep bugging me for a long time😂😂😂, sorry. I understood the other parts pretty well though. Thanks for another great explanation🤗🤗 Edit: I think I got it. Please tell me if I am correct or not. The reason we are inverting the result, is the fact that we never worked with inverted digits in the actual codes like we did in dry runs, but the right side(the mirror world) needs to be inverted. In the dry run as the digits were mentioned, it got a little confusing for me I guess, and to think of it, it is pretty simple😂😂😂😂. Anyways thanks man.

Recursion wala approch mujhe samaj aa gaya kaafi clean and clear code h apko

Bhaiya aap konse college se ho aur kon se year me.. Aapki placement ho gyi hai kya

Broooooo, long time no see😂😂😂, how are you doing? Hope you are great. For me it's another day, another close call for daily challenges. I first thought that today's problem would be a drag(and also I read "at most one swaps" as "at least two swaps"🫡), but then I realised after watching this, it's just a bunch of dry runs.... "Do a dry run and understand" should be a motto😂😂😂😂. I tried to solve the last few days' problems on my own, and solved 2 of them, others took a lot of time to understand. I hope I will get there one day.... Anyways, It's good to have you back bro🤜🏽. And thanks for the explanation as always😂😂

Done!!❤

Thanks sir❤ for a lovely explanation

Great explanation❤

Done👍

Today is 15 Oct, I know Raj personally :)

your methods are unique

great explanation and approach But have a doubt ... why you used this approach instead of using a min-heap which will reduce TC to O(NlogK) and SC to O(K) like if i get asked similar question is this sorting + sliding window approach enough or i shall try going further with min-heap

ayy thankyou

Yo bro, it's done, and I have finally caught up with the daily problems😂😂... Using a map can be really helpful, and I always overlook when and where to use it. Like today, when we are going to store the list numbers, I thought we were gonna store it in an array or something😂😂😂😂, and while watching the code, then I realised that we can also use a map😂😂😂.... Man, I always overlook basic things😮‍💨... Anyways, the explanation was crystal clear, I didn't have much problem to understand. And yeah what you said in the beginning of the video, it could have been a medium problem if the whole sorting part is clear. Come to think of it, we have been doing lots of sorting these few days in leetcode😂😂😂😂. Anyways, as always thanks bro✊🏽✊🏽🔥

Great explaination sir. But I am not able to solve question by myself I feel very demotivated.. Plzz tell something.. I am in third year and next year will begin my placement session..

Thank you bhaiya, I was eagerly waiting for your video.

It is also very similar to previous problem... To tell you the truth, at the time when I was watching this, it was way too late at night😂😂😂😂 and I was a bit drowsy. As soon as I finished with the code, I just went straight to bed😂😂😂😂. I submitted the code at 5:15 or something 😂😂😂😂, close call, huh!!😅😂 Anyways, I understood almost everything, I mean there wasn't much to understand after the previous video. But I gotta say, your explanations makes things way easier to understand. Thanks bro ✊🏽✊🏽

Yo... The examples were awesome😂😂. I also thought that I will use tuples, but then I changed my mind and used a class-object instead. I could somewhat relate it to CPU scheduling techniques in OS😂😂😂(I absolutely loved that topic).... And yes, I totally agree, I understood a lot from this... Thanks bro for the great explanation 🔥🔥🤜🏽

Bro why sweep line algorithm fails here class Solution { public int minGroups(int[][] intervals) { HashMap<Integer,Integer> map = new HashMap<>(); ArrayList<Integer> help = new ArrayList<>(); HashSet<Integer> set = new HashSet<>(); for(int i=0;i<intervals.length;i++){ map.put(intervals[i][0],map.getOrDefault(intervals[i][0],0)+1); map.put(intervals[i][1],map.getOrDefault(intervals[i][1],0)-1); help.add(intervals[i][0]); help.add(intervals[i][1]); } Collections.sort(help); int max = 0; int sum = 0; for(int i:help){ if(set.contains(i))continue; sum += map.get(i); max = Math.max(max,sum); set.add(i); } return max==0?1:max; } } It gives wrong answer for 34th testcase Output 99999 Expected 100000

Yoooo, I hope you are doing great. In case you might be wondering, why I was silent for last 2 days or so😂😂😂😂, I was really busy "pandal hopping" with my friends😂. As you may know, this time of the year we have Durga puja, and since I live in Kolkata, it is a pretty huge deal. And like most people here, I also hangout(a lot) in these times with my friends😂😂. I was usually so tired after getting home, I really couldn't try to sit and code😢😢. So I asked a friend to help me maintain the streak, thanks to him my "streak" is still intact😂😂😂. Now I regret it so much so I am going to do the codes of last two days myself(after understanding concepts)... And here I am😂😂.

Done!!

bhaiya can u plss explain the 72 and 73 line

00:06 Solving LeetCode POTD 1942 - Number of the Smallest Unoccupied Chair 00:48 Understanding and solving advanced level questions on LeetCode. 02:12 Storing arrival and living time in an array 02:48 Understanding seat allocation based on the number of friends in LeetCode problem 03:59 Understanding seat occupation based on arrival time. 04:36 Occupying the smallest unoccupied chair 05:47 Allocation of empty seats among guests. 06:24 Understanding seat allocation based on friend numbers 07:35 Understanding chair allocation order for faster 'freeing' 08:10 Explanation of index changes in the given case. 09:18 Comparing arrival time, departure time, and last time using friend index and new index 09:56 Understanding the concept of tuples and their usage. 11:17 Understanding the importance of data structures and scalability 11:55 Understanding data structures and variable storage in C++ 13:10 Understanding nodes, structures, and values usage in coding 13:44 Creating a vector to store arrival time, departure time, and fund index together 14:51 Understanding representations and their values 15:26 Comparison of arrival times for two variables a and b 16:39 Prioritize sorting smallest available chair first 17:13 Understanding the smallest unoccupied chair in a value-based order set. 18:21 Understanding priority queue and implementing order set 18:54 Understanding the smallest unoccupied chair using a real-life example. 20:09 Understanding seat prioritization based on departure time 20:46 Understanding seat occupation logic based on index allocation 21:55 Discussing the availability of free seats and comparing arrival and departure times. 22:35 Understanding the concept of arrival time and smallest departure time for comparison 23:46 Sorting nodes based on arrival time for chair allocation 24:22 Understanding the concept of the smallest unoccupied chair index 25:37 Confusion over seating allocation 26:10 Allocating chairs to friends based on arrival time 27:21 Waiting for the third friend to vacate the chair by 10:00 27:53 Understanding the concept of Next Available Chair Index 29:03 Understanding the concept of unoccupied chairs with time details. 29:36 Understanding Priority in Seating Arrangement 30:44 Understanding seat allocation based on given scenario 31:20 Implementing data structures in coding 32:26 Accessing values using dot operator 32:59 Creating and manipulating objects in different cases 34:08 Understanding priority in busy schedules 34:46 Comparing arrival and departure times for seat availability 35:58 Understanding the concept of unoccupied chairs and their values. 36:32 Finding the time when a chair will be free. 37:31 Understanding the importance of arrival time

Thank you bro, you are awesome. I searched extensively yesterday but struggled to understand the concepts. Your explanation made everything much clearer, and I truly appreciate your help.

aise ques to hard category me hone chahiye🥶

bro, suggestion: Slow down your pace. You sound a bit anxious. You have an amazing presentation in front on you. But take a pause, and slow down. Your presentation will flow with more clarity. I totally understand what you are saying. just want you to get even better and gain crazy subscribers!

god level explaination!!!!!!!!

Bro, Can you pls make the video in english? Your content is really good and I want to continue following along with you to better understand. Can you really please consider to make the content in english?

bro share your linkedin

Thanks man, this was really helpful!

Already completed, just came to check out the video. It was almost 90% the same as yesterday's code😂😂😂.... The video was really fun. The "nalla launde" are very relatable. But we should aspire to be like that "Sigma" dude😂😂😂😂😂😂😂😂. Anyways bro, thanks 😂.

Thanks bro, 6:20 cleared my doubts

Amazing solution

Concpet ✅ mic sound❌ Bhaiya mic quality improve kriye please 🥹🥹

Hey bro, I completed it. It was a fun video... really🤣🤣🤣. Now I also want to pair with a girl🥲. But I guess I have no rizz😂😂. Anyways it was like yesterday's question. It was easy to understand, though I couldn't understand all that AB and [C] stuff they put at the beginning. Now about your follow up question, I tried to solve it. But its seems after changing my code, to work with these, the code is not generating proper results. Like take an example: '] } { ) ( [' (remove the spaces between). I don't think that this can be done in 2 swaps, it will take 3 swaps. But my code is generating 2 as the answer. Personally I want to be in this situation ") [ )" where '[' = Indian boy(me😁) and ')' = Russian girl, but jokes aside, I couldn't solve this problem, and now I am frustrated. You know what I will attach my code, (I already done it using multiple variables for indian, american and russian boys and girls, but that didn't worked either). Even 'ChadGPT' is giving stupid answers..... Please tell me what I am doing wrong 😞... sorry import math def minSwaps(s: str) -> int: boys = 0 girl = 0 for char in s: if(boys > 0 and (char == ']' or char == '}' or char == ')')): boys -= 1 else: if(char == '[' or char == '{' or char == '('): boys += 1 else: girl += 1 single = boys if(single == 1): return 1 return math.ceil(single/2)

Follow Up Question : What if '{}' and '()' also allowed ? Think them as foreign people XD [ ] - india { } - america ( ) - russia Try This it will be easy if you understand the approach i teached

bhaiya what does overlapping of l and r pointer signify exactly??

Yo, I completed it late, but got it just in time😮‍💨. Anyways, today's problem was easier than I thought. I was messed up trying some map or stuff like that😂😂😂😂. It was pretty understandable after I solved it thanks to you. Anyways, I guess now I understand why you asked about LinkedIn in the other comment of mine. I don't even know what happened, I rarely open the stupid app(haven't even decorated my profile, it's just there as a dummy😂😂). And I am not even that active on social media too. I am way too lazy or too busy to play games😂😂😂😂. I just want to tell you, don't get discouraged if someone tries to demotivate you. Because there will always be people who are willing to encourage you to do the same. Keep up the good work bro🤜🏽🤜🏽. And thanks again 😁

Thank You Bhai ❤

Another great explanation thank you ❤

Bhaiya deque ka bhi use kar k solve kar sakte hai ... Bhaiya apka linkedin mil sakta hai kya

bro what an explanation ! thankyou

Contest m cheating krke Knight pahochta h tu aur fir Linkedin pe flex krta 😂😂

Yo... Welcome back, how are you doing? I have done my code on time, I watched your video as well. As helpful as always. Today's problem was almost easy, I could have done it on my own, but couldn't slide the window😂😂😂😂. Oh well, after watching your video, it's done😂😂🎉. Thanks bro🤜🏽

Aare bhaiya ekdum baap level explanation pura crystal clear samaj aa gaya... maja aa gaya bhaiya

if you can please make seperate playlists for all the possible patterns used in problem solving...it would be of great help!!

00:05 Learning about permutation in string and sliding window concept 00:44 Understanding the concept of permutation in string 01:54 Understanding permutation in strings. 02:27 Understanding permutation and factorial concepts 03:34 Understanding factorial and permutation 04:15 Understanding different permutations in strings 05:22 Demonstrating permutation generation and checking in strings 05:58 Identifying exact permutation in a string 07:12 Understanding permutation using next permutation concept 07:46 Generate next permutation for current string 08:53 Permutation in String involves applying permutations on a string repeatedly to generate new strings. 09:22 Understanding complexity in permutations calculation 10:28 Understanding the complexity of permutations in strings 11:07 Permutation is like arranging letters in any order. 12:11 Understanding permutation generation through string manipulation. 12:47 Understanding the permutation of strings based on their lengths. 13:50 String permutation generation and validity check 14:20 Understanding permutation using characters in a string. 15:28 Generating all permutations of a string efficiently. 16:03 Permutation in String - LeetCode POTD 17:13 Understanding string permutation using hashmap and counting technique. 17:43 Handle incomplete substrings by setting answer to false 18:42 Understanding string size and character count in fixed size areas. 19:16 Understanding the optimal approach for character counting. 20:20 Increasing frequency of next character 20:58 Understanding and implementing the process of permutation in strings. 22:10 Understanding sliding window concept in LeetCode problems. 22:39 Understanding sliding window concept for problem solving. 23:45 Checking if a string can be formed from another string by counting characters 24:16 Exploring string traversal and frequency counting using sliding window concept 25:23 Comparing character counts using an optimal approach 25:57 Discussing match count and window frequency 27:01 Implementation Logic of Permutation in Strings Mapping Count 27:35 Converting values and storing frequencies in a map 28:37 Checking frequency and mapping. 29:07 Understanding character manipulation for value changes and counting 30:23 Explanation on indexing for covering lines 30:55 Concept clarified to a great extent

sir aap god hoo!!!!!!!!!!!!!!!!....literally itna in depth explaination .....please dont ever stop making such videos!!!!