YJDave
/ knapsack_fill_bag.py
Created
October 16, 2021 13:01
0-1 Knapsack Problem - Brute Force, Dynamic Programming solutions
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #https://www.youtube.com/watch?v=kvyShbFVaY8&list=PL_z_8CaSLPWekqhdCPmFohncHwz8TY2Go&index=3 | |
| #https://www.geeksforgeeks.org/0-1-knapsack-problem-dp-10/ | |
| """ | |
| Given the weight and value of each item and capacity of bag, | |
| find the combination of items to take such that the value of | |
| selected items in bag is maximum. | |
| """ | |
| """ | |
| Brute force solution: | |
| consider each combination of item(n) and select the one with maximum value |
YJDave
/ gsoc2019.md
Last active
August 25, 2019 13:54
Google Summer of Code 2019 with Zulip Final Report
This summer was very learning experience for me :)
I've worked on stream settings issues and mostly custom profile field project this summer. Following is the list of all merged PRs
- Custom profile field backend + frontend UI
- Stream settings minor issues/bugs/features