Видео

Nice explanation, thanks. Quick question - Which software did you use for these animation, its quite cool :)

both dfs and bfs can be used to get the max depth of the tree,

Great summary, although the templates are a bit convoluted to me. It should be made easier to visualize at first glance.

This is an AI generated voice. It's actually not terrible, and I've seen other videos on this channel and you do know what you're talking about. So why did you decide to go with the generated voice, instead of your own?

bro whats with the music. am i on hold for tech support?

hilarious video

I can't think logic of an easy leetcode problems can't solve a single easy leetcode problem till now from 2 years I m learning 😖😖😖

Best if the best like 3b1b in Math ,your animations is in whole other league bro for dsa

17:54: Does this only apply to solutions where you limit the max size of the heap to k? Couldn’t you use a full-size minHeap, then pop k elements to get the same result of the k smallest numbers? I’m assuming there’s a reasoning behind it that I’m missing. Thank you for the content, this has been very helpful in studying.

The moving background in the video is quite distracting and makes it difficult to concentrate on the material being explained. When trying to read or understand technical concepts, the constant motion draws attention away from the content, making it harder to follow along.

I don't understand why the didn't just use the same algorithm for finding the longest common sub-sequence for the longest palindrome sub-sequence. Should just be able to take the input string as string 1, reverse it and then run the same code for the two strings.

This video is very misleading. Important information is left out and some of the examples used don’t really demonstrate the full use of the patterns. The template code is also very clunky. It almost seems like the person narrating the video hasn’t grinded any Leetcode problems before. Is this what you can expect of algomonster?

There is really no need for the background music, it's just annoying and distracting!

16:38 The background music is a huge mistake... it's very relaxing

Excellent! Thank you so much for this video. All of the data structures can be overwhelming to remember, you breaking them down into categories, with their use cases, and providing templates was so useful.

well this video worked, just signed up for the black Friday special :)

Thanks for posting that tutorial. So far 3 coding interviews had DFS. First one I think I completed successfully without knowing what DFS was (although could have been faster) and the interviewer said "Wow, it was as though invented DFS from scratch in this interview". Sadly wasn't hired to that position. Next was a color bucket photoshop style coding question, and next was a island sizes question or similar. Posting tutorials of all of those would be nice.

dont know why but feel little bit of confident by seeing some medium level could be solved by patterns

phenomenal bro, u got a talent for this

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