sorry i really have to say, the main narrator did an excellent job in explaining the things in a clear logical way. But the second narrator is just too confusing with his logic and it is very distracting to have him interrupting the logic flow of the main narrator. He should be removed.

sorry i really have to say, the main narrator did an excellent job in explaining the things in a clear logical way. But the second narrator is just too confusing with his logic and it is very distracting to have him interrupting the logic flow of the main narrator. He should be removed.

sorry i really have to say, the main narrator did an excellent job in explaining the things in a clear logical way. But the second narrator is just too confusing with his logic and it is very distracting to have him interrupting the logic flow of the main narrator. He should be removed.

Slow down, it's not a race. Unless you don't understand what you are doing.

Much appreciation from self-learner!👍

I understood the video is legit when musk interviewed mark and asked the exact same question.

or just copy and paste the problem intro it and feed the code

In `DFS` function 16:07 path.pop() never execute.

Regarding Binary Search for the "Find Minimum in Rotated Sorted Array" problem, I'm a bit unsure if the boolean array approach works. For example, if we have the rotated array of [50, 60, 70, 80, 90, 10, 20, 30, 40], wouldn't the approach return 20 instead of 10?

Thank you so much.

You don't have to figure out the second dimension for the last problem because, we can solve it with a 1D array. Here's the code. class Solution: def canPartition(self, nums: List[int]) -> bool: ts = sum(nums) n = len(nums) if ts%2: return False ss = ts//2 dp = [0]*(ss+1) for j in nums: for i in range(ss,-1,-1): if dp[i]==1 and i+j<=ss: dp[i+j]=1 if j==i: dp[i]=1 return True if dp[ss] else False

what the fudge are you saying at 9:16

wow ! this gave so much clarity

thanks a lot man. never thought of solving leetcode as templates .this is really helpful.

This is what I was looking for!

Absolutely loved this video! Thanks a lot!

Hello, curious, how come the Vehicle had a method called parkInSpot(). Would that violate the Single Responsibility Principal from SOLID? Why is a vehicle class responsible for parking when it should be handled by something like a ParkingSpot class? Thanks for your insight!

Could you share some discount for your subscription?

For the TF question (binary search) you forgot to stipulate that the input only has false, then true (can’t do TFTF) Also, the vocal AI had a hiccup at the 9m mark lmao

Very helpful bro!

Unable to buy your course from India. It say "Merchant is non-compliant with RBI guidelines for recurring payments and e-mandate". And yes I have international payments on on my card

Do you guys ask input size constraints in interviews?

I like how math is last resort

This helped me solve Next Greater element without looking at your code, thanks!

one of the best videos on the topic i’ve seen, thank you

For 10^8 inputs ? O(n) ?

Leetcode has nothing to do with the real-world programming in 99% of cases.

Thanks for the update, Anna! It is great that you are sharing your experience so that others can have hope.

😂😂

Damn, man, your dependency hierarchy is all over the place here...

Why is there an AI voice over?

Couldn’t you also go from left to right? You could store the indexes in the stack and as soon as you add an element greater than the element at the top of the stack, you keep removing the top until it’s equal or greater to the new element, while updating their values (sorry for the bad explanation)

where do i check this stuff out again?

Best Platform

great video

Thank you so much sir for the wonderful video

This is by far the best (and most painful😂) video on dp. I need to lie down

thank u so much

I kindly request that you should make videos avoiding moving backgrounds, as they can be distracting while concentrating . By the way, great explanation!

The best video on the whole channel. Great intro to the DP problems

Really good explanation. I'll agree with everyone else and say that the background is extremely distracting, and it actually makes the bitrate of the whole video go down, making the quality poor whether I select 144p or 1080p. I also feel like you didn't explain the algorithm before going through the problem with the heights of people. You started going through the example, but I didn't know precisely what it was you were doing or why you were making the decisions that you were making. I think it would be nice to have a plain explanation of the problem and how the algorithm solves it before going through the problem step by step.

This is a common question so want to make a special note here: - In an online coding assessment, you can obviously use this technique. - In an in-person interview, you should always ask for the constraints up front , as they are a part of the problem definition. The difference between n=10 and n=10,000 can entirely changes the problem. And requirement gathering is a key part of an engineer's skill set. Also make sure you know how to use the patterns: kzbin.info/www/bejne/iIq3YWt5lr6kbKM

That's a very useful way of solving problems in OAs and CP challenges but in an interview, you cannot rely on this trick. A lot of the times, the interviewer will not mention a specific constraint and would ask you to come up with as many solutions as you can. Starting from the bruteforce to as optimal as it gets. Therefore it is more important to learn problem patterns, you should only come to the constraint part when you're confused between two approaches.

But in some cases due to this we overthink to optimise the time complexity. I think this fails and make us overthink specially in case of O(N) ARMOTISED complexity

Absolutely, i just don't remember how many times i have been asked binary search like finding indices of the numbers repeated in a sorted array 😂

Pretty dumb video. Wasted 5 minutes

Thank you for making this :) Keep it up

really great man thanks!!

incredible insight, thank you

This is the first thing you do in a problem. What if a problem is easy because of input size and you're optimizing nothing, that's just premature optimization. For example, if you have a dataset of 100 rows and you need to implement some algo which is naively N^2 but you spend useless time making it O(N) and more complex, in any case that's a bad idea. Leetcode says a problem is easy/med/hard and that just shifts your thinking.