Video

Thanks soo much you are appreciated

Thanks so much! You’re amazing!

very good explanation thanks

Great overview as I 'm awaiting to do my Meta final rounds end of this month. Your DSA Videos has been a real gem. Maybe a simple request, would kindly point me to some good Product Architecture materials, I will really appreciate

Very well explained!

Thank you soo much! You are appreciated!

Thanks a lot man

Awesome, thank you for explaining everything so neatly. Doesn't even feel like a Hard problem now.

I think it's better to mention the read write ratio as part of your non functional requirements. Here we can say that it's 100 to 1 which means many more read vs write and therefore we will scale our design accordingly.

Don't think there is such thing as async Queue. It's just a queue that you can have many workers to pull from giving you async operations. Just wanted to clarify that there is no special queue referred to as async queue.

Do we need to implement Trie Solution?

These are very insightful questions to ask that some may really overlook e.g. inward honesty

Emotional Damage @ 5m 31s

Awesome! Thank you!

Thank you I I just now seen all 18 videos on resume review and this common mistake video helped me to realize what mistake I am making in, Thank you. I will share my resume after changing it all again. Now I understand why my resume does picks at FAANG

Man, I am loving your videos 😂

Nice video.

If we init right to max(piles) wouldn't it make sense to init left to max(min(piles)//h, 1)? Am I missing something here?

Found this solution and explanation more intuitive than others!

You said the time complexity of naive solution is O(2N), but I just think it's O(N). Even the traverse is twice which is by p and also by q, total sum of them won't be greater than N.

This is the best solution and explanation to this problem! Thank you because finally after watching 3 different videos, this one matches with the intuition I was originally thinking of.

Very clear explanation, thank you so much! I only knew how to use union find to solve this problem instead of dfs, now i know both!

Great video as always. I came across another solution which is also very good, little tricky but still good one. class Solution { public boolean isValidPalindrome(String s, int k) { int stringLength = s.length(); int[][] dp = new int[stringLength][stringLength]; // Initialize each character as a palindrome of length 1 for (int i = 0; i < stringLength; ++i) { dp[i][i] = 1; } // Build the table in a bottom-up manner for (int i = stringLength - 2; i >= 0; --i) { for (int j = i + 1; j < stringLength; ++j) { // If characters match, take the length from the diagonally lower cell and add 2 if (s.charAt(i) == s.charAt(j)) { dp[i][j] = dp[i + 1][j - 1] + 2; } else { // If characters do not match, take the max from either side (ignoring one character) dp[i][j] = Math.max(dp[i + 1][j], dp[i][j - 1]); } // If the palindrome length plus the allowed deletions covers the whole string length, it is valid if (dp[i][j] + k >= stringLength) { return true; } } } // If none of the substrings could be a palindrome with the given k, return false return false; } }

I love your honesty. This is one of the most useful videos you have posted. Thanks so much for this.!

Thanks

How is T: O(n) + O(D), if for every node we are checking if its in to_delete then shouldn't it be O(n) * O(D), what am I missing?

good explaination!

subbed!

Thanks Bro for the Clear Explanation..

So hello Interview has a video on Ad Click aggregator where he mentions that if candidate doesn't take the streaming approach (Flink or Spark ....) and instead propose batch processing, that's a straight downgrade to a lower level. You mentioned to just know of what streaming is but they are saying that you not only need to propose but go in the ins and outs of it as to how Flink provides different features that are used in a System Design. I for one who is preparing for Product design just get confused with mixed requirements 😞

Great stuff. I got one coming for E5 and I opted out for Product Architecture since I primarily have been a front end developer and full stack for last 5 years. Issue is that I have front end for Desktop applications (Winforms + WPF) and not web and clearly when talking about api, we need to use Rest API which is web. Don't think that's a big transition though. I have been trying to get my head around exactly how Product Architecture is different from System design and this video did help out a lot. Looking forward to watch part 2 :-). Though, it'd be great if you could take like say a list of 20 most common questions and categorize them b/w Product Vs System Design. Some are obvious but some are not. For example, Web Crawler is clearly a system design but what about Ad click Aggregator? For Ad click, user has to interact with the ad. So does it not fall into Product? But based on Hello Interview, its a System Design. So it gets confusing. What about short Url? Is it Product Design? Hopefully you see my point :-). If you are interested, I can list 20 questions and you can categorize?

For the good karma!

Usually your explanations are awesome, but this one, didn't quite understand. Lee's sol on leetcode solutions is much better

Both time and space complexity are exponential in backtracking.

6:54

So for the back of the envelope calculation, one thing that always bother me is that it tells the interviewer next to nothing except that the candidate can do some basic maths, so it would just take up a few mins without actually contributing to the interview. most, if not all of the time, the system that we are designing is supposed to handle “a lot” of traffic, I dont think I ever actually refer back to the numbers because ultimately in these scenarios they are made up, just make the system scalable and add cache for faster read if its read heavy. The video is great, I just wanted to rant a bit. Thanks for all of the content, keep it up.

public class Solution { public double[] MedianSlidingWindow(int[] numbers, int k) { if (numbers == null || numbers.Length == 0 || k == 0) { return new double[0]; } // Work on C# List, not array var list = new List<double>(); int half = k >> 1; int median = half + (k & 1) - 1; // k = 1, median = 0; k = 2, median = 0; k = 3, median = 1 var slideWindow = new List<double>(); for (int i = 0; i < numbers.Length; i++) { if (i >= k) { slideWindow.Remove(numbers[i - k]); } int index = slideWindow.BinarySearch(numbers[i]); if (index < 0) { index = ~index; } slideWindow.Insert(index, numbers[i]); if (i >= k - 1) { list.Add(half == median? slideWindow[half] : (slideWindow[half] + slideWindow[median])/2 ); } } return list.ToArray<double>(); } }

So crisp and clear! I think for the `neg = 1 + neg if neg else 0` some comments in the code would've been helpful just to explain whats going on when you revisit the code later on

R.E.A.D.M.E format is really good. This video could be your best video ever. Thanks a lot for sharing!

Very great video! Is there any way I could ask you a quick question? In any case, you’re such talented man

So clear. Thank you very much

Why can’t we set right as min(ribbons) as we cannot make a cut if ribbon is smaller than mid?

Super helpful as I prepare for my upcoming Meta Interview

Thanks. Very well explained :)

Your answer did not go through. The hash map method went through fine. I got this "time limit exceed' error using your answer. Please help....

omg, thank you thank you thnak you!

this question should be marked easy. So many easy ones on LC are way harder than this one.

Thanks for your videos. It is shame that not so many people know about your channel.

I like how you went through what the hashmap will look like in the beginning, very clear

Explanation at 4:47 is wrong. You want to undo the 3 + 5 operation, so it would be 8 - 5 , not 8 - 3. Best to avoid this approach. Stack based approach is much simpler.