Knapsack Problem | Greedy Approach | Sinhala

Опубликовано: 04 Февраль 2026
на канале: CodePRO LK

2,775

Knapsack Problem | Greedy Approach | Sinhala
The Knapsack problem involves selecting a subset of items from a set of items, each with a weight and a value, to fill a knapsack of limited capacity, such that the total value of the selected items is maximized.

🔥Support us:   / codeprolk

▬▬▬▬▬▬ L I N K S 🔗▬▬▬▬▬▬
Code: https://github.com/dineshpiyasamara/D...

▬▬▬▬▬▬ T I M E S T A M P S ⏰ ▬▬▬▬▬▬
00:00 Introduction
00:22 Fractional Knapsack problem
07:18 Python implementation

▬▬▬▬▬▬ Want to learn more? 🚀 ▬▬▬▬▬▬
► Machine Learning Tutorial -    • Machine Learning Tutorial | Sinhala
► Deep Learning Tutorial -    • Deep Learning Tutorial | Sinhala
► Python Tutorial -    • Python Programming Tutorial | Sinhala
► Java Tutorial -    • Java Programming Tutorial | Sinhala
► MATLAB Tutorial -    • MatLab Tutorial - Sinhala
► Python Libraries(Numpy, Matplotlib, Pandas) -    • NumPy, MatplotLib, Pandas Tutorial | Sinha...
► Database Management System -    • Database Management Systems | Sinhala
► Data Structures & Algorithms -    • Data Structures and Algorithms | Sinhala

▬▬▬▬▬▬ Connect with me 👋 ▬▬▬▬▬▬
► WEBSITE - https://codeprolk.com
► FACEBOOK -   / codeprolkofficial
► LINKEDIN -   / codepro-lk
► TIKTOK -   / codeprolk
► WHATSAPP - https://whatsapp.com/channel/0029Vahy...
► GITHUB - https://github.com/dineshpiyasamara

#programming
#sinhala
#codeprolk