Tap here to switch tabs
Problem
Submissions

Problem: Find Subsequence of Length K with the Largest Sum

Find Subsequence of Length K with the Largest Sum asks you to choose a subsequence of exactly k elements from an integer array and return the one with the greatest sum while preserving order.

Statement

You are given an integer array nums and an integer k. Your task is to find a subsequenceA subsequence is an array derived from another array by deleting some or no elements while preserving the order of the remaining elements. of nums of length k that has the largest possible sum.

Constraints:

  • 1≤1 \leq nums.length ≤1000\leq 1000

  • −105≤-10^5 \leq nums[i] ≤105\leq 10^5

  • 1≤1 \leq k ≤\leq nums.length

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Find Subsequence of Length K with the Largest Sum

Find Subsequence of Length K with the Largest Sum asks you to choose a subsequence of exactly k elements from an integer array and return the one with the greatest sum while preserving order.

Statement

You are given an integer array nums and an integer k. Your task is to find a subsequenceA subsequence is an array derived from another array by deleting some or no elements while preserving the order of the remaining elements. of nums of length k that has the largest possible sum.

Constraints:

  • 1≤1 \leq nums.length ≤1000\leq 1000

  • −105≤-10^5 \leq nums[i] ≤105\leq 10^5

  • 1≤1 \leq k ≤\leq nums.length