## Longest Common subsequence

Question: Given two sequences, find the length of longest subsequence present in both. A subsequence is a sequence of characters of a string generated after deleting some or all characters from that string without changing the order of remaining string characters For example: If we have two string “abcde” and Read more…

## 0-1 Knapsack Dynamic Programming

Question: Given weights and profits of n items, put these items in a knapsack of capacity W to get the maximum total profit. 0-1 property:  You can either pick the item or not. Also you have only one copy of each item. Let’s solve this question first using brute force Read more…

Insert math as
$${}$$