Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2099. Find Subsequence of Length K With the Largest Sum
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source