Видео

You are very dedicated. Really cool!! Thanx

best kmp video on ytb

This exaplanation is awesome, wonderful. Thank for the wonderful service!!

Goat 🥂

Genius ❤

Amazing explanation on dynamic programming! For this example it would be a really cool to add transposition which adds a nice extra special case.

what an amazing way to build intuition for such problems! thank you!!

thanks it was good i never learnt it before like this it is nice but needs math that why IT always better to have good math grasp

Incredible video.

Thank you man

Great video!

amazing. thanks

Don't like to throw the race card in there but THANK YOU!

Amazing!!!

Within a minute or so, I knew this was going to be one of the best explanations I have seen or read. Thanks!

row = int(input()) user_input = [] for i in range(row): user_input.append(list(map(int, input().split()))) def kadane(user_input): max_global = float("-inf") max_current = 0 for i in range(len(user_input)): max_current += user_input[i] if max_current > max_global: max_global = max_current if max_current < 0: max_current = 0 return max_global max_global = float("-inf") running_row_sum = [0] * len(user_input) for run in range(len(user_input[0])): running_row_sum = [0] * len(user_input) for l in range(run, len(user_input[0])): for r in range(len(user_input)): current_number = user_input[r][l] running_row_sum[r] += current_number best_max_sub_list = kadane(running_row_sum) if best_max_sub_list > max_global: max_global = best_max_sub_list print(max_global) acm.timus.ru/problem.aspx?space=1&num=1146

Great video

Very Helpful, Fantastic Explanation

Love this video

ive left more confused than before. :(

8:02, why do we move backwards in the array arr? Is there any reason behind this? Why not moving forwards?

THANK YOU SO MUCH!!!!!

Nice video man. I like your style of teaching, this is the first ever video of yours that I've watched and I like the casual style of teaching. It would be great if you could make videos that emphasize the guiding principle behind solving a problem and then share ways to attack the problem as well, in a direct way. Thanks and Cheers!

8:14 starts here

Absolutely the best video to explain this. Just took away all my frustration lol!!

Greate video, Thanks a lot!

i think you're the love of my life

Thank you!!!

Hath Mila Bhai 🤝

why are you explaining things better than the people who get paid to do it? why do I have to pay 1800 for college credit to learn the material on youtube?

Amazing wonderfully explained

super super love this

Well done

Thank you so much!

1. why we are ONLY able to put the new left/right Parentheses at the rightest side every time? 2. According to the above limitation, why we could say the final level leafs are the answer? Thanks 🙇‍♂

Nice explanation :)

16:25 he makes this feel so epic.

lol got this question for amazon applied scientist role 2 years ago and i didn't know it was LRU cache

I've struggled with the knapsack problem for so long. I learned a lot from your video. Thank you!

Great Explanation

TY so much great explanation and I dont even speak english that well! Love from italy

Thank you so much

at 6:00 I was like, say no more => Subscribed. fkn love the way explain stuff man

good job brother very appreciate it

Best expiation ever sir. Thank you so much for your efforts.

Thank you, sir! You explained it with great energy and clarity.

Sorry but show big trees not that small stuff

nice, thank you

Is it possible to solve this question without looking at solution ?

Very detailed explanation with a big array! Thank you .