Загрузка страницы

What can “The Simpsons” teach us about Dynamic Programming?

An introduction to dynamic programming, how to approach these types problems, and we'll step through a few basic ones.

Support me on:
Patreon: https://www.patreon.com/simondevyt

Follow me on:
Twitter: https://twitter.com/iced_coffee_dev
Instagram: https://www.instagram.com/beer_and_code/
Github: https://github.com/simondevyoutube/
Covering dynamic programming, top down vs bottom up approaches. What is memoization and tabulation. Will also answer a few quick problems like the Fibonacci series, Coin Change, Min Path Sum, 0-1 Knapsack, Subset Sum, and the Staircase problem.

Видео What can “The Simpsons” teach us about Dynamic Programming? канала SimonDev
Показать
Комментарии отсутствуют
Введите заголовок:

Введите адрес ссылки:

Введите адрес видео с YouTube:

Зарегистрируйтесь или войдите с
Информация о видео
29 октября 2021 г. 21:00:04
00:15:08
Яндекс.Метрика