Leetcode 2099. Find Subsequence of Length K With the Largest Sum

Given an integer array nums and k, pick k elements (keeping their relative order) whose sum is maximized and return any such subsequence. The challenge is to choose the k largest-valued elements while preserving original ordering (n ≤ 1000).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2099. Find Subsequence of Length K With the Largest Sum

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact