Question d’entretien chez Amazon

A question on Dynamic Programming.....a modification of longest increasing subsequence problem