Question d’entretien chez Quantiphi

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