Tap here to switch tabs
Problem
Submissions

Problem: Find the K-Sum of an Array

Find the K-Sum of an Array asks you to return the kth largest sum among all subsequences, counting duplicate sums separately and including the empty subsequence as zero.

Statement

You are given an integer array, nums, and a positive integer k. Your task is to determine and return the kthk^{th} largest possible sum among all subsequences of the array. A subsequence is formed by deleting no or more elements from the array without changing the order of the remaining elements. The sum of a subsequence is the total of its elements.

Remember: For valid subsequences:

  • The empty subsequence is valid, and its sum is considered 00.

  • Duplicate subsequence sums are allowed and counted separately when determining the kthk^{th} largest.

Constraints:

  • n==n == nums.length

  • 1≤1 \leq n ≤103\leq 10^3

  • −103≤-10^3 \leq nums[i] ≤103\leq 10^3

  • 1<=1 <= k ≤min(1000,2n)\leq min(1000, 2^n)

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Find the K-Sum of an Array

Find the K-Sum of an Array asks you to return the kth largest sum among all subsequences, counting duplicate sums separately and including the empty subsequence as zero.

Statement

You are given an integer array, nums, and a positive integer k. Your task is to determine and return the kthk^{th} largest possible sum among all subsequences of the array. A subsequence is formed by deleting no or more elements from the array without changing the order of the remaining elements. The sum of a subsequence is the total of its elements.

Remember: For valid subsequences:

  • The empty subsequence is valid, and its sum is considered 00.

  • Duplicate subsequence sums are allowed and counted separately when determining the kthk^{th} largest.

Constraints:

  • n==n == nums.length

  • 1≤1 \leq n ≤103\leq 10^3

  • −103≤-10^3 \leq nums[i] ≤103\leq 10^3

  • 1<=1 <= k ≤min(1000,2n)\leq min(1000, 2^n)