Mountain Scenes | Dynamic Programming

WilliamFiset

Подписаться 179 тыс.

Просмотров 10 тыс.

50% 1

Видео Поделиться Скачать Добавить в

Опубликовано:

7 сен 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 15

@amanthapliyal2636 4 года назад

Great Explanation of the concept! Was able to understand both Recursive way and then why we could use DP!

@satyajitdas2780 4 года назад

Thanks. William. Perfect explanation. Looking for more DP problems.

@mzmzgreen 4 года назад

Awesome explanation! Could you please analyze the time/space complexity of the algorithms you're showing?

@piyushnaithani7689 4 года назад

Awesome, after a long time I see a nice DP problem solver on youtube

@ramkrishnakulkarni8289 4 года назад

100th like. Absolutely loved the video. Waiting for more videos on dp.

@mgehad 3 года назад

Hey Thank you for your efforts. May I ask you. - is it possible to mod the plain scenes count then subtract the total from the plain or its gonna cause errors?

@polysimplifed Месяц назад

why not just calculate the number of all possible combinations, and then subtract with the unqualified solutions?

@afzalsiddique7165 3 года назад

12:42 -> Why "ribbon < 0"? And not "ribbon

@rahulsangvikar7973 2 года назад

Because ribbon = 0 is fine. We can skip the current column completely. But we can't add negative ribbon to the column

@bazgo-od7yj 2 месяца назад

8:23 why does it say 11, not10?

@CrystalSergeant 4 года назад

next time please provide bottom up approach is it is harder to get.

@giorgos-4515 3 года назад

13:08 thats a dp technique called memoization there is a great video from codecamporg that illustrates it perfectly

@lenlen8099 3 года назад

To me dp comes from memoization

@giorgos-4515 3 года назад

@@lenlen8099 i mean dp is mostly recursion and recursion can get costly so it makes sense,just not entirely.(if it was any kind of joke it went completely over my head)