greedy algorithm Continuous Knapsack Problem Also known as the fractional knapsack problem. Continuous knapsack problem can be solved by a greedy algorithm.

dynamic programming Subset Sum Problem A special case of 0/1 Knapsack Problem Given a finite set \(S = \{ s \in \mathbb{Z}_+\}\) and an integer \(t < 0 \), is there a subset

dynamic programming Longest Common Subsequence #ifndef MEHARA_LONGEST_COMMON_SUBSEQUENCE_H_ #define MEHARA_LONGEST_COMMON_SUBSEQUENCE_H_ #include <deque> #include <vector> std::deque<char> LongestCommonSubsequence(std::vector<char> sequence1, std:

MathJax When \(a \ne 0\) , there are two solutions to \(ax^2 + bx + c = 0\) and they are $$x = {-b \pm \sqrt{b^2-4ac} \over 2a}.$$

dynamic programming The Coin Change Problem The coin change problem is a classic dynamic programming problem (unbounded knapsack problem) which can be solved recursively. N = Coins with different denominations D = Array of denominations S = Total amount to make C

silchar सिलचर सिलचर (Silchar) २ साल पुरानी बात है ये, लेकिन लगता है अब तो... कि १ अरसा सा हो गया है। दिल्ली पीछे छोड़ के