Динамическое программирование. Часть 4. Задача о рюкзаке. Knapsack problem. Код на Python

Learn algorithms with me! Course link: https://stepik.org/a/184350 My Python courses: 1. Python - FULL COURSE (Part 1): https://stepik.org/course/174852 2. Python - FULL COURSE (Part 2): https://stepik.org/a/186192 *** All courses on Stepik: https://stepik.org/users/623224055 *** I recommend subscribing to the open channel. We discuss internships, programming, and much more there, and it's also where I make all my announcements first: https://t.me/analitiqtutor *** Improving yourself with me! Sign up for classes here: Message me on Telegram: https://t.me/analitiqq Message me on VK: https://vk.com/analitiqvk *** Timecodes: 00:00 Introduction 01:44 About an attempt at greedy implementation 03:42 0-1 Backpack (Algorithm) 14:23 0-1 Backpack (Python Code) 25:51 Backpack with Costs (Algorithm) 37:39 Backpack with Costs (Python Code) 41:19 Backpack with a Limited Number of Items 51:00 Backpack with an Unlimited Number of Items 53:34 The "Kettlebells" Problem 59:42 Conclusion *** Tags: #algorithms #programming #python *** We continue exploring the topic of "Dynamic Programming." This video explores the knapsack problem. The video covers the analysis of a 0-1 knapsack, a knapsack with costs, and a knapsack with a limited and unlimited number of items. Enjoy watching. *** Problems are available here: https://informatics.msk.ru Solutions are available here: https://github.com/blacksmithalex/inf... *** Useful links: https://algocode.ru/page/c-8-knapsack https://habr.com/ru/post/561120/