thanks brother, God bless you!

No doubt You are the goat

Good video thanks🎉🎉

you're the real mvp my friend

to merge k elements we need at least k elements, thats means length should be at least k, then condition should be like L < K , but you you said l < k - 1 thats confusing, and at several point you didnt clarify some equation and some logic, k + k - 1 this i got it, but how its related to came up in (n - 1) % (k - 1) == 0 this equation, in an interview we have to clarify this kind of thing properly.

Anyone can make tutorials with codes, mathematical intuition is what lacking. You are doing good job in this regard .Nice video sir!

Wow , Such an indepth explnaination, Thanks for sharing, can you help me to understand, why there are high chances of contoure of l1 regularizer part and loss function part to coincide, where atleast one weight would be zero ? @csfolks

The product rule seems to have used three parts of four in each equation so they are not seperable which is confusing for me.

Everyone is writing same types of comment Excellent explanation. Stop collecting people to write same type of comment. Poor Audio quality. At 13:07 I didnt understood if (l % (k-1) ==0 ) then sum all of them . What was that ?

Very nice, concise explanation. Much appreciated <3

great explanation!!

❤❤

Good Explanation Sir!!

Great explanation! everywhere else just went through code, but your visualisation helped alot

itna badhiya explanation bro... amazing

Nice explanation.

amazing

finally someone explains it well

Amazing vro , Actually I was not getting why mid+=K , why not mid++ , but cleared thanks a lot

Thank you bhai kya explanation diya ab jaa k samajh mai aaya

thats really meaningful thanks :) wht is the relation of taking bunch of sample with the direction. Like summation of errors will give a positive value for direction?

Excellent explanation 👍

can you check your math? the differentiation in the last term doesn't look right to me. if u= w^T*X^T*X and v = w, using the product rule, you will get a different result.

Thanks

this is a wonderful meditation. thank you

Amazing!!

nice explanation bro. You have good skills on concept as well as explanation. Thank you so much we need much more explanation videos of different concepts

Thanks, Shivank! It's really helpful, Please keep posting.

The code links are not working, please have a look into it [or shift it into a github repo]

MUSIC IS irritating

poor video sound

most concise and simplified explaination . 😀😀

Thank you so much! This was super helpful and easy to follow especially for someone out of touch with basic vector calculus

If you will be joining Amazon as a software engineer then what was the use of your MBA

Have a question for the shard that contains the channel messages. Does discord store messages from different sort id (channel_id, bucket_id) on different shard, or message from different channels could reside on the same shard? If it's latter case, it still need go through all the messages in the shard to find those belonging to the specific channel_id, is that correct?

Great explanation for Sort items problem 👍

Excellent step-by-step explanation. Other speakers don't say why we need the l mod (k-1) logic. I think you could make your presentation even better by explaining that l is the largest index -- not the length. The examples could run from a0, a1, ..., al. That would make it clear that when (l = length - 1) piles compress down to (k-1) piles we need to add the full sum from 0 to l to account for merging the remaining pile with the final k piles. Thanks.

Glad I found this. I am not great at solving expressions, I have a doubt why we need to do gradient for solving L, Is that the standard proc or anything else, Please someone clarify. Sorry if this is a silly one...

Very Nice Explanation.THANKS.

Thank you, such a great video!

In this, i dont see any code of initializing the grid. I wrote this code in java but its coming 0 instead of 5 for the usecase you discussed initially...not getting why ? This is my grid/array: 0,1,-1 1,0,-1 1,1,1 Please help

Very good explanation 👍

Thanks a lot 2 bar dekhne k bad aur leetcode discuss pdhne k bad aakhir smjh m aahi gya

very poor explanation

awesome explanation !

if this was on codeforces what would be the rating? like this is not a typical hard on leetcode. definitely one of the hardest I have solved.

Nice explanation sir

When k=3 and if we are at len4 ex:i=0, j=3 we can't merge the stones rt as if we merge 3 stones we are left with 2 there is no way we can merge them but you are writing dp[i][j] exists i am not getting this

how is the gain ratio calculated in a decision tree of a drug. for a classification.

why Greedy is failing??