Pergunta de entrevista da empresa smallcase

Find a subsequence of length "n" which has the highest sum in an array.