0/1 Knapsack Problem

dynamic programming

Levenshtein Distance
Partition Problem
Subset Sum Problem

See all 5 posts →

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:

Aman Mehara

1 min read

mathematics

Quadratic Equations

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}.$ Discriminant: $D = b^2-4ac$ If $\alpha$ and \(\beta\

Aman Mehara

1 min read

Aman Mehara

—

0/1 Knapsack Problem