Quantiphi interview question

Maximum sum of a subsequence (Dynamic Programming) knapsack(0/1)