Leetcode 410 Split Array Largest Sum

preview_player
Показать описание


My gears:

Рекомендации по теме
Комментарии
Автор

notice how he hits submit before run. That's greatness

codenchill
Автор

I finally got it with this video. Better than any other ones on this question.

pranav
Автор

The binary search in short: search for the smallest max sum value that we can split the array to be less than or equal to m subarrays that satisfy the requirement.

RenZhang
Автор

Awesome explanation for DP. It helps a lot.

호호-oz
Автор

I finally understood how to solve this problem. Thank you. Keep it up.

dmytroivanovv
Автор

Thank you so much! It explains very well.

awreeoooh
Автор

love how you first did some the pseudo code with examples. fkn brilliant!

codenchill
Автор

Only you are able to properly explain the use of binary search in this problem, waiting for more videos.

anuragdojo
visit shbcf.ru