bottom-up
Here are 5 public repositories matching this topic...
Solution for SPOJ questions
-
Updated
Oct 15, 2018 - C++
It is a classic dynamic programming problem in which we have to collect items in the knapsack in such a way that our profit is maximized. The difference between this problem and the fractional knapsack one is that you CANNOT take a fraction of an item.
-
Updated
Jun 6, 2021 - C++
This repository contains Solutions of Famous DP problems.
-
Updated
Feb 5, 2021 - C++
Given an array or list of n integers, we need to find the longest increasing subsequence. The array could include positive and negative integers.
-
Updated
Jun 6, 2021 - C++
Improve this page
Add a description, image, and links to the bottom-up topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the bottom-up topic, visit your repo's landing page and select "manage topics."